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_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:35:15,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:35:15,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:35:15,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:35:15,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:35:15,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:35:15,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:35:15,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:35:15,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:35:15,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:35:15,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:35:15,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:35:15,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:35:15,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:35:15,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:35:15,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:35:15,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:35:15,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:35:15,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:35:15,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:35:15,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:35:15,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:35:15,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:35:15,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:35:15,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:35:15,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:35:15,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:35:15,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:35:15,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:35:15,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:35:15,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:35:15,341 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:35:15,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:35:15,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:35:15,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:35:15,360 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:35:15,360 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:35:15,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:35:15,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:35:15,360 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:35:15,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:35:15,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:35:15,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:35:15,361 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:35:15,361 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:35:15,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:35:15,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:35:15,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:35:15,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:35:15,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:35:15,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:35:15,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:35:15,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:35:15,362 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:35:15,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:35:15,362 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:35:15,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:35:15,399 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:35:15,402 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:35:15,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:35:15,403 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:35:15,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,686 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc5daf42b9 [2018-04-10 16:35:15,827 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:35:15,828 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:35:15,828 INFO L168 CDTParser]: Scanning sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,835 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:35:15,835 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:35:15,835 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:35:15,836 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,836 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:35:15,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ulong in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_set in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__div_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ushort in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__SLL in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____useconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsword_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__register_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uint in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____socklen_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____intptr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__size_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__idtype_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__wchar_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:15,859 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc5daf42b9 [2018-04-10 16:35:15,862 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:35:15,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:35:15,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:35:15,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:35:15,870 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:35:15,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:35:15" (1/1) ... [2018-04-10 16:35:15,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3902da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:15, skipping insertion in model container [2018-04-10 16:35:15,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:35:15" (1/1) ... [2018-04-10 16:35:15,886 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:35:15,912 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:35:16,065 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:35:16,105 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:35:16,110 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-10 16:35:16,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16 WrapperNode [2018-04-10 16:35:16,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:35:16,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:35:16,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:35:16,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:35:16,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (1/1) ... [2018-04-10 16:35:16,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (1/1) ... [2018-04-10 16:35:16,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (1/1) ... [2018-04-10 16:35:16,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (1/1) ... [2018-04-10 16:35:16,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (1/1) ... [2018-04-10 16:35:16,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (1/1) ... [2018-04-10 16:35:16,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (1/1) ... [2018-04-10 16:35:16,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:35:16,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:35:16,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:35:16,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:35:16,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (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:35:16,289 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:35:16,289 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:35:16,290 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:35:16,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:35:16,291 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:35:16,292 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:35:16,293 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:35:16,294 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:35:16,295 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:35:16,296 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:35:16,297 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:35:16,298 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:35:16,299 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:35:16,300 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:35:16,301 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:35:16,301 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:35:16,301 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:35:16,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:35:16,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:35:16,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:35:16,780 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:35:16,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:35:16 BoogieIcfgContainer [2018-04-10 16:35:16,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:35:16,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:35:16,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:35:16,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:35:16,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:35:15" (1/3) ... [2018-04-10 16:35:16,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20256771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:35:16, skipping insertion in model container [2018-04-10 16:35:16,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:35:16" (2/3) ... [2018-04-10 16:35:16,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20256771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:35:16, skipping insertion in model container [2018-04-10 16:35:16,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:35:16" (3/3) ... [2018-04-10 16:35:16,785 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:35:16,791 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:35:16,795 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-10 16:35:16,826 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:35:16,826 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:35:16,826 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:35:16,827 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:35:16,827 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:35:16,827 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:35:16,827 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:35:16,827 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:35:16,827 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:35:16,827 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:35:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2018-04-10 16:35:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:35:16,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:16,844 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:16,845 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash 166545801, now seen corresponding path program 1 times [2018-04-10 16:35:16,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:16,848 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:16,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:16,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:16,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:16,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:16,959 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:35:16,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:16,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:35:16,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:35:16,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:35:16,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:35:16,975 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 4 states. [2018-04-10 16:35:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:17,164 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-04-10 16:35:17,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:35:17,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:35:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:17,175 INFO L225 Difference]: With dead ends: 218 [2018-04-10 16:35:17,176 INFO L226 Difference]: Without dead ends: 214 [2018-04-10 16:35:17,177 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:35:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-10 16:35:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2018-04-10 16:35:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-10 16:35:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-04-10 16:35:17,217 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 8 [2018-04-10 16:35:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:17,217 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-04-10 16:35:17,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:35:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2018-04-10 16:35:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:35:17,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:17,218 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:17,218 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 166545802, now seen corresponding path program 1 times [2018-04-10 16:35:17,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:17,219 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:17,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:17,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:17,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:17,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:17,273 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:35:17,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:17,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:35:17,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:35:17,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:35:17,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:35:17,275 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 4 states. [2018-04-10 16:35:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:17,415 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-04-10 16:35:17,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:35:17,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:35:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:17,416 INFO L225 Difference]: With dead ends: 207 [2018-04-10 16:35:17,416 INFO L226 Difference]: Without dead ends: 207 [2018-04-10 16:35:17,417 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:35:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-10 16:35:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-10 16:35:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 16:35:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-10 16:35:17,424 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 8 [2018-04-10 16:35:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:17,425 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-10 16:35:17,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:35:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-10 16:35:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:35:17,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:17,425 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:35:17,425 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322413, now seen corresponding path program 1 times [2018-04-10 16:35:17,425 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:17,426 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:17,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:17,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:17,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:17,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:35:17,475 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:35:17,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:17,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:35:17,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:17,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:17,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:17,476 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 5 states. [2018-04-10 16:35:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:17,753 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-04-10 16:35:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:35:17,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:35:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:17,755 INFO L225 Difference]: With dead ends: 329 [2018-04-10 16:35:17,755 INFO L226 Difference]: Without dead ends: 329 [2018-04-10 16:35:17,755 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:35:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-10 16:35:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 193. [2018-04-10 16:35:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 16:35:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2018-04-10 16:35:17,764 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 17 [2018-04-10 16:35:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:17,765 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-04-10 16:35:17,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2018-04-10 16:35:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:35:17,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:17,765 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:35:17,766 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:17,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322412, now seen corresponding path program 1 times [2018-04-10 16:35:17,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:17,766 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:17,767 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:17,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:17,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:17,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:17,824 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:35:17,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:17,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:35:17,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:17,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:17,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:17,825 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand 5 states. [2018-04-10 16:35:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:18,014 INFO L93 Difference]: Finished difference Result 360 states and 397 transitions. [2018-04-10 16:35:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:35:18,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:35:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:18,015 INFO L225 Difference]: With dead ends: 360 [2018-04-10 16:35:18,015 INFO L226 Difference]: Without dead ends: 360 [2018-04-10 16:35:18,015 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:35:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-04-10 16:35:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 192. [2018-04-10 16:35:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 16:35:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-04-10 16:35:18,022 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 17 [2018-04-10 16:35:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:18,022 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-04-10 16:35:18,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-04-10 16:35:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 16:35:18,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:18,023 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:35:18,023 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash -337938114, now seen corresponding path program 1 times [2018-04-10 16:35:18,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:18,023 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:18,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:18,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:18,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:18,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:18,046 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:18,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:18,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:18,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:18,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:18,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:18,119 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:35:18,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:35:18,132 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:35:18,133 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:35:18,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,139 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:35:18,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-10 16:35:18,177 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:35:18,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:18,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,187 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:35:18,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-10 16:35:18,210 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:35:18,212 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:35:18,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,217 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:35:18,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,223 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:35:18,223 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-10 16:35:18,232 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:35:18,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:18,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:35:18,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:35:18,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:35:18,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:35:18,233 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 8 states. [2018-04-10 16:35:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:18,561 INFO L93 Difference]: Finished difference Result 331 states and 356 transitions. [2018-04-10 16:35:18,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:35:18,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-10 16:35:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:18,562 INFO L225 Difference]: With dead ends: 331 [2018-04-10 16:35:18,562 INFO L226 Difference]: Without dead ends: 331 [2018-04-10 16:35:18,563 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:35:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-10 16:35:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 191. [2018-04-10 16:35:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-10 16:35:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-04-10 16:35:18,569 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 20 [2018-04-10 16:35:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:18,569 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-04-10 16:35:18,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:35:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2018-04-10 16:35:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 16:35:18,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:18,570 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:35:18,570 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -337938113, now seen corresponding path program 1 times [2018-04-10 16:35:18,570 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:18,570 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:18,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:18,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:18,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:18,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:18,586 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:18,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:18,586 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:18,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:18,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:18,625 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:35:18,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:35:18,638 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:35:18,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:35:18,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,662 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:35:18,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:35:18,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,674 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:35:18,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2018-04-10 16:35:18,703 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:35:18,706 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:35:18,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,735 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:35:18,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:18,740 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:35:18,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,754 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:35:18,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,768 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:35:18,768 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 [2018-04-10 16:35:18,794 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:35:18,796 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:35:18,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,806 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:35:18,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:18,816 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:35:18,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,832 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:35:18,835 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:35:18,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,847 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:35:18,848 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:18,857 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:35:18,857 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:18,865 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:35:18,865 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:65, output treesize:9 [2018-04-10 16:35:18,871 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:35:18,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:18,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:35:18,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:35:18,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:35:18,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:35:18,872 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand 9 states. [2018-04-10 16:35:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:19,261 INFO L93 Difference]: Finished difference Result 337 states and 357 transitions. [2018-04-10 16:35:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:35:19,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-10 16:35:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:19,264 INFO L225 Difference]: With dead ends: 337 [2018-04-10 16:35:19,264 INFO L226 Difference]: Without dead ends: 337 [2018-04-10 16:35:19,264 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:35:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-10 16:35:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 190. [2018-04-10 16:35:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-10 16:35:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2018-04-10 16:35:19,267 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 20 [2018-04-10 16:35:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:19,267 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2018-04-10 16:35:19,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:35:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2018-04-10 16:35:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 16:35:19,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:19,268 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:35:19,268 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -296054905, now seen corresponding path program 1 times [2018-04-10 16:35:19,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:19,268 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:19,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:19,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:19,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:19,302 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:35:19,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:19,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:35:19,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:19,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:19,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:19,303 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 5 states. [2018-04-10 16:35:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:19,372 INFO L93 Difference]: Finished difference Result 282 states and 306 transitions. [2018-04-10 16:35:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:35:19,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-10 16:35:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:19,373 INFO L225 Difference]: With dead ends: 282 [2018-04-10 16:35:19,373 INFO L226 Difference]: Without dead ends: 282 [2018-04-10 16:35:19,373 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:35:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-10 16:35:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 194. [2018-04-10 16:35:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 16:35:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-10 16:35:19,377 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 26 [2018-04-10 16:35:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:19,377 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-10 16:35:19,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-10 16:35:19,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:35:19,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:19,378 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:35:19,378 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684908, now seen corresponding path program 1 times [2018-04-10 16:35:19,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:19,379 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:19,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:19,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:19,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:19,389 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:19,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:19,389 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:19,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:19,418 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:35:19,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:19,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:19,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:35:19,428 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:35:19,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:19,430 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:35:19,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 16:35:19,434 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:35:19,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:19,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:35:19,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:19,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:19,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:19,435 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 5 states. [2018-04-10 16:35:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:19,535 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2018-04-10 16:35:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:35:19,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 16:35:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:19,536 INFO L225 Difference]: With dead ends: 206 [2018-04-10 16:35:19,536 INFO L226 Difference]: Without dead ends: 206 [2018-04-10 16:35:19,536 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:35:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-10 16:35:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 186. [2018-04-10 16:35:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-10 16:35:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-04-10 16:35:19,538 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 28 [2018-04-10 16:35:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:19,539 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-04-10 16:35:19,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-04-10 16:35:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:35:19,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:19,539 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:35:19,540 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684909, now seen corresponding path program 1 times [2018-04-10 16:35:19,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:19,540 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:19,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:19,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:19,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:19,549 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:19,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:19,549 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:19,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:19,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:19,575 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:35:19,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:19,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:19,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:19,595 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:35:19,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:19,598 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:35:19,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-10 16:35:19,604 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:35:19,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:19,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:35:19,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:19,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:19,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:19,604 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 5 states. [2018-04-10 16:35:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:19,715 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2018-04-10 16:35:19,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:35:19,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 16:35:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:19,716 INFO L225 Difference]: With dead ends: 240 [2018-04-10 16:35:19,716 INFO L226 Difference]: Without dead ends: 240 [2018-04-10 16:35:19,716 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:35:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-10 16:35:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 213. [2018-04-10 16:35:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 16:35:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 240 transitions. [2018-04-10 16:35:19,720 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 240 transitions. Word has length 28 [2018-04-10 16:35:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:19,720 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 240 transitions. [2018-04-10 16:35:19,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 240 transitions. [2018-04-10 16:35:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:35:19,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:19,721 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:19,721 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 265761851, now seen corresponding path program 1 times [2018-04-10 16:35:19,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:19,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:19,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:19,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:19,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:19,767 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:35:19,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:19,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:35:19,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:35:19,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:35:19,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:35:19,768 INFO L87 Difference]: Start difference. First operand 213 states and 240 transitions. Second operand 6 states. [2018-04-10 16:35:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:19,930 INFO L93 Difference]: Finished difference Result 305 states and 345 transitions. [2018-04-10 16:35:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:35:19,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 16:35:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:19,931 INFO L225 Difference]: With dead ends: 305 [2018-04-10 16:35:19,931 INFO L226 Difference]: Without dead ends: 305 [2018-04-10 16:35:19,932 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:35:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-10 16:35:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 212. [2018-04-10 16:35:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-10 16:35:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 239 transitions. [2018-04-10 16:35:19,934 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 239 transitions. Word has length 31 [2018-04-10 16:35:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:19,934 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 239 transitions. [2018-04-10 16:35:19,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:35:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 239 transitions. [2018-04-10 16:35:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:35:19,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:19,935 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:35:19,935 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash 265761852, now seen corresponding path program 1 times [2018-04-10 16:35:19,935 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:19,935 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:19,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:19,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:19,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:19,979 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:35:19,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:19,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:35:19,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:35:19,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:35:19,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:35:19,980 INFO L87 Difference]: Start difference. First operand 212 states and 239 transitions. Second operand 6 states. [2018-04-10 16:35:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:20,160 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2018-04-10 16:35:20,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:35:20,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 16:35:20,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:20,161 INFO L225 Difference]: With dead ends: 329 [2018-04-10 16:35:20,161 INFO L226 Difference]: Without dead ends: 329 [2018-04-10 16:35:20,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:35:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-10 16:35:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 197. [2018-04-10 16:35:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 16:35:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 223 transitions. [2018-04-10 16:35:20,164 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 223 transitions. Word has length 31 [2018-04-10 16:35:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:20,164 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 223 transitions. [2018-04-10 16:35:20,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:35:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 223 transitions. [2018-04-10 16:35:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:35:20,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:20,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:35:20,165 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:20,165 INFO L82 PathProgramCache]: Analyzing trace with hash -788385734, now seen corresponding path program 1 times [2018-04-10 16:35:20,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:20,165 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:20,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:20,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:20,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:20,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:20,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:35:20,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:20,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:20,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:20,211 INFO L87 Difference]: Start difference. First operand 197 states and 223 transitions. Second operand 5 states. [2018-04-10 16:35:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:20,270 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-04-10 16:35:20,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:35:20,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-10 16:35:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:20,271 INFO L225 Difference]: With dead ends: 220 [2018-04-10 16:35:20,271 INFO L226 Difference]: Without dead ends: 220 [2018-04-10 16:35:20,271 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:35:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-10 16:35:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 197. [2018-04-10 16:35:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 16:35:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 221 transitions. [2018-04-10 16:35:20,275 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 221 transitions. Word has length 36 [2018-04-10 16:35:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:20,275 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 221 transitions. [2018-04-10 16:35:20,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 221 transitions. [2018-04-10 16:35:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:35:20,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:20,276 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:35:20,276 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2065889067, now seen corresponding path program 1 times [2018-04-10 16:35:20,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:20,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:20,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:20,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:20,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:20,359 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:35:20,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:20,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:35:20,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:35:20,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:35:20,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:35:20,360 INFO L87 Difference]: Start difference. First operand 197 states and 221 transitions. Second operand 8 states. [2018-04-10 16:35:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:20,585 INFO L93 Difference]: Finished difference Result 302 states and 333 transitions. [2018-04-10 16:35:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:35:20,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-10 16:35:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:20,586 INFO L225 Difference]: With dead ends: 302 [2018-04-10 16:35:20,587 INFO L226 Difference]: Without dead ends: 302 [2018-04-10 16:35:20,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:35:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-10 16:35:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 213. [2018-04-10 16:35:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 16:35:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 238 transitions. [2018-04-10 16:35:20,589 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 238 transitions. Word has length 42 [2018-04-10 16:35:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:20,589 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 238 transitions. [2018-04-10 16:35:20,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:35:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 238 transitions. [2018-04-10 16:35:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:35:20,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:20,590 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:35:20,590 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310599, now seen corresponding path program 1 times [2018-04-10 16:35:20,590 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:20,590 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:20,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:20,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:20,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:20,627 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:35:20,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:20,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:35:20,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:20,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:20,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:20,628 INFO L87 Difference]: Start difference. First operand 213 states and 238 transitions. Second operand 5 states. [2018-04-10 16:35:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:20,815 INFO L93 Difference]: Finished difference Result 363 states and 410 transitions. [2018-04-10 16:35:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:35:20,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 16:35:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:20,816 INFO L225 Difference]: With dead ends: 363 [2018-04-10 16:35:20,816 INFO L226 Difference]: Without dead ends: 363 [2018-04-10 16:35:20,816 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:35:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-10 16:35:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 212. [2018-04-10 16:35:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-10 16:35:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-04-10 16:35:20,819 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 43 [2018-04-10 16:35:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:20,819 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-04-10 16:35:20,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-04-10 16:35:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:35:20,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:20,820 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:35:20,820 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310600, now seen corresponding path program 1 times [2018-04-10 16:35:20,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:20,820 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:20,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:20,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:20,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:20,857 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:35:20,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:20,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:35:20,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:20,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:20,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:20,858 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 5 states. [2018-04-10 16:35:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:21,049 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2018-04-10 16:35:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:35:21,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 16:35:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:21,050 INFO L225 Difference]: With dead ends: 327 [2018-04-10 16:35:21,050 INFO L226 Difference]: Without dead ends: 327 [2018-04-10 16:35:21,050 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:35:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-10 16:35:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 211. [2018-04-10 16:35:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-10 16:35:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2018-04-10 16:35:21,053 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 43 [2018-04-10 16:35:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:21,053 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2018-04-10 16:35:21,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2018-04-10 16:35:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 16:35:21,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:21,053 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:35:21,054 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash 928654395, now seen corresponding path program 1 times [2018-04-10 16:35:21,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:21,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:21,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:21,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:21,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:21,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:21,061 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:21,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:21,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:21,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:21,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:21,091 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:35:21,092 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:35:21,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,103 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:35:21,105 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:35:21,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 16:35:21,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:35:21,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:21,129 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:35:21,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,147 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:35:21,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:21,152 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:35:21,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 16:35:21,240 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:35:21,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:21,243 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:21,244 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:35:21,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,258 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:35:21,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:21,261 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:21,262 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:35:21,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,272 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:35:21,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-10 16:35:21,298 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:35:21,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:21,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 16:35:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:35:21,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:35:21,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:35:21,300 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand 9 states. [2018-04-10 16:35:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:21,657 INFO L93 Difference]: Finished difference Result 374 states and 409 transitions. [2018-04-10 16:35:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:35:21,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-10 16:35:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:21,659 INFO L225 Difference]: With dead ends: 374 [2018-04-10 16:35:21,659 INFO L226 Difference]: Without dead ends: 374 [2018-04-10 16:35:21,660 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:35:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-10 16:35:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 236. [2018-04-10 16:35:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:35:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 262 transitions. [2018-04-10 16:35:21,665 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 262 transitions. Word has length 44 [2018-04-10 16:35:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:21,665 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 262 transitions. [2018-04-10 16:35:21,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:35:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 262 transitions. [2018-04-10 16:35:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:35:21,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:21,666 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:35:21,666 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash -819000242, now seen corresponding path program 1 times [2018-04-10 16:35:21,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:21,666 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:21,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:21,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:21,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:21,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:21,680 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:21,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:21,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:21,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:21,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:21,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:21,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:21,720 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:35:21,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:35:21,736 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:35:21,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:35:21,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,746 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:35:21,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-10 16:35:21,775 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:35:21,777 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:35:21,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,806 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:35:21,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-10 16:35:21,825 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:35:21,827 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:35:21,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:35:21,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:21,841 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:35:21,841 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-10 16:35:21,850 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:35:21,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:21,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:35:21,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:35:21,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:35:21,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:35:21,850 INFO L87 Difference]: Start difference. First operand 236 states and 262 transitions. Second operand 8 states. [2018-04-10 16:35:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:22,121 INFO L93 Difference]: Finished difference Result 257 states and 286 transitions. [2018-04-10 16:35:22,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:35:22,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 16:35:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:22,122 INFO L225 Difference]: With dead ends: 257 [2018-04-10 16:35:22,122 INFO L226 Difference]: Without dead ends: 257 [2018-04-10 16:35:22,123 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:35:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-10 16:35:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235. [2018-04-10 16:35:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-10 16:35:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 261 transitions. [2018-04-10 16:35:22,125 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 261 transitions. Word has length 46 [2018-04-10 16:35:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:22,125 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 261 transitions. [2018-04-10 16:35:22,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:35:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 261 transitions. [2018-04-10 16:35:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:35:22,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:22,126 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:35:22,126 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:22,126 INFO L82 PathProgramCache]: Analyzing trace with hash -819000241, now seen corresponding path program 1 times [2018-04-10 16:35:22,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:22,126 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:22,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:22,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:22,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:22,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:22,137 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:22,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:22,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:22,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:22,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:22,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:22,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:22,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:22,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:35:22,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-10 16:35:22,219 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:35:22,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,236 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:35:22,240 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:35:22,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,251 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:35:22,253 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:35:22,253 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,260 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:35:22,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:49, output treesize:34 [2018-04-10 16:35:22,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-10 16:35:22,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:35:22,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,303 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:35:22,304 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:35:22,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,319 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:35:22,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:69 [2018-04-10 16:35:22,337 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:35:22,338 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:35:22,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,345 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:35:22,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,380 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:35:22,381 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:35:22,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:35:22,386 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,393 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:35:22,393 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-10 16:35:22,399 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:35:22,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:22,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:35:22,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:35:22,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:35:22,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:35:22,400 INFO L87 Difference]: Start difference. First operand 235 states and 261 transitions. Second operand 8 states. [2018-04-10 16:35:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:22,606 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2018-04-10 16:35:22,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:35:22,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 16:35:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:22,607 INFO L225 Difference]: With dead ends: 256 [2018-04-10 16:35:22,607 INFO L226 Difference]: Without dead ends: 256 [2018-04-10 16:35:22,607 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:35:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-10 16:35:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 234. [2018-04-10 16:35:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-10 16:35:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2018-04-10 16:35:22,609 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 46 [2018-04-10 16:35:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:22,609 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2018-04-10 16:35:22,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:35:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2018-04-10 16:35:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:35:22,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:22,610 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:35:22,610 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash 410486952, now seen corresponding path program 1 times [2018-04-10 16:35:22,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:22,610 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:22,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:22,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:22,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:22,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:22,620 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:22,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:22,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:22,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:22,657 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:35:22,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:22,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:22,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:35:22,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:22,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:22,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:22,689 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:35:22,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-04-10 16:35:22,708 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:35:22,709 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:35:22,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,717 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:35:22,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-04-10 16:35:22,766 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:35:22,769 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:35:22,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,790 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:35:22,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:59 [2018-04-10 16:35:22,835 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:35:22,838 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:35:22,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:22,852 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:35:22,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:74 [2018-04-10 16:35:28,881 WARN L151 SmtUtils]: Spent 2015ms on a formula simplification. DAG size of input: 34 DAG size of output 30 [2018-04-10 16:35:28,911 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:35:28,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:28,921 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:35:28,922 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:28,922 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:35:28,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:28,926 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:35:28,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:28,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:28,933 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:35:28,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:80, output treesize:15 [2018-04-10 16:35:28,965 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:35:28,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:28,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:35:28,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:35:28,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:35:28,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=136, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:35:28,966 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand 14 states. [2018-04-10 16:35:31,158 WARN L151 SmtUtils]: Spent 2029ms on a formula simplification. DAG size of input: 48 DAG size of output 44 [2018-04-10 16:35:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:31,903 INFO L93 Difference]: Finished difference Result 509 states and 554 transitions. [2018-04-10 16:35:31,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:35:31,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-04-10 16:35:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:31,906 INFO L225 Difference]: With dead ends: 509 [2018-04-10 16:35:31,906 INFO L226 Difference]: Without dead ends: 509 [2018-04-10 16:35:31,906 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=205, Invalid=495, Unknown=2, NotChecked=0, Total=702 [2018-04-10 16:35:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-10 16:35:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 339. [2018-04-10 16:35:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-10 16:35:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 388 transitions. [2018-04-10 16:35:31,913 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 388 transitions. Word has length 47 [2018-04-10 16:35:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:31,913 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 388 transitions. [2018-04-10 16:35:31,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:35:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 388 transitions. [2018-04-10 16:35:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:35:31,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:31,914 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:31,914 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash 410486953, now seen corresponding path program 1 times [2018-04-10 16:35:31,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:31,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:31,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:31,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:31,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:31,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:31,924 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:31,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:31,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:31,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:31,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:31,971 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:35:31,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:31,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:31,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:31,979 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:35:31,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:31,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:31,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-10 16:35:31,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:35:31,995 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:35:31,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:31,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,004 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:35:32,005 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:35:32,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,016 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:35:32,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-10 16:35:32,044 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:35:32,045 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:35:32,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,063 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:35:32,064 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:35:32,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,081 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:35:32,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-04-10 16:35:32,141 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:35:32,145 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:35:32,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,168 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:35:32,170 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:35:32,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,186 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:35:32,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:90 [2018-04-10 16:35:36,270 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:35:36,276 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:35:36,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,282 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:35:36,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,306 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:35:36,307 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:35:36,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:35:36,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,333 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:35:36,333 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-04-10 16:35:36,354 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:35:36,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:36,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:35:36,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:35:36,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:35:36,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:35:36,355 INFO L87 Difference]: Start difference. First operand 339 states and 388 transitions. Second operand 14 states. [2018-04-10 16:35:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:37,206 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-04-10 16:35:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:35:37,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-04-10 16:35:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:37,207 INFO L225 Difference]: With dead ends: 569 [2018-04-10 16:35:37,207 INFO L226 Difference]: Without dead ends: 569 [2018-04-10 16:35:37,208 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:35:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-04-10 16:35:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 346. [2018-04-10 16:35:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-10 16:35:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 394 transitions. [2018-04-10 16:35:37,212 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 394 transitions. Word has length 47 [2018-04-10 16:35:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:37,212 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 394 transitions. [2018-04-10 16:35:37,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:35:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 394 transitions. [2018-04-10 16:35:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:35:37,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:37,212 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:35:37,212 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:37,213 INFO L82 PathProgramCache]: Analyzing trace with hash -774878600, now seen corresponding path program 1 times [2018-04-10 16:35:37,213 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:37,213 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:37,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:37,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:37,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:37,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:37,223 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:37,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:37,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:37,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:37,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:37,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:37,261 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:35:37,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-04-10 16:35:37,274 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:35:37,276 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:35:37,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,281 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:35:37,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-04-10 16:35:37,303 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:35:37,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:37,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,317 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:35:37,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-04-10 16:35:37,346 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:35:37,348 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:35:37,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,358 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:35:37,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:52 [2018-04-10 16:35:43,380 WARN L151 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-04-10 16:35:43,407 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:35:43,408 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:35:43,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:43,411 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:35:43,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:43,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:43,415 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:35:43,416 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2018-04-10 16:35:43,430 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:35:43,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:43,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-10 16:35:43,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:35:43,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:35:43,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:35:43,431 INFO L87 Difference]: Start difference. First operand 346 states and 394 transitions. Second operand 14 states. [2018-04-10 16:35:59,594 WARN L151 SmtUtils]: Spent 2020ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-04-10 16:36:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:12,045 INFO L93 Difference]: Finished difference Result 487 states and 528 transitions. [2018-04-10 16:36:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:36:12,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-04-10 16:36:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:12,046 INFO L225 Difference]: With dead ends: 487 [2018-04-10 16:36:12,046 INFO L226 Difference]: Without dead ends: 477 [2018-04-10 16:36:12,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=250, Invalid=608, Unknown=12, NotChecked=0, Total=870 [2018-04-10 16:36:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-10 16:36:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 336. [2018-04-10 16:36:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-04-10 16:36:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 382 transitions. [2018-04-10 16:36:12,050 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 382 transitions. Word has length 49 [2018-04-10 16:36:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:12,051 INFO L459 AbstractCegarLoop]: Abstraction has 336 states and 382 transitions. [2018-04-10 16:36:12,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:36:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 382 transitions. [2018-04-10 16:36:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:36:12,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:12,051 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:36:12,051 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1107305343, now seen corresponding path program 1 times [2018-04-10 16:36:12,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:12,052 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:12,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:12,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:12,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:12,113 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:36:12,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:36:12,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:36:12,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:36:12,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:36:12,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:36:12,114 INFO L87 Difference]: Start difference. First operand 336 states and 382 transitions. Second operand 7 states. [2018-04-10 16:36:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:12,272 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2018-04-10 16:36:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:36:12,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-10 16:36:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:12,275 INFO L225 Difference]: With dead ends: 351 [2018-04-10 16:36:12,275 INFO L226 Difference]: Without dead ends: 351 [2018-04-10 16:36:12,275 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:36:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-10 16:36:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2018-04-10 16:36:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-10 16:36:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 387 transitions. [2018-04-10 16:36:12,280 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 387 transitions. Word has length 53 [2018-04-10 16:36:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:12,280 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 387 transitions. [2018-04-10 16:36:12,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:36:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 387 transitions. [2018-04-10 16:36:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 16:36:12,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:12,281 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:12,281 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash 815273570, now seen corresponding path program 1 times [2018-04-10 16:36:12,282 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:12,282 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:12,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:12,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:12,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:12,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:36:12,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:36:12,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:12,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:36:12,380 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:36:12,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 8 treesize of output 7 [2018-04-10 16:36:12,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,386 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:36:12,387 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:36:12,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-10 16:36:12,398 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:36:12,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:12,400 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:36:12,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,411 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:36:12,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:12,413 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:36:12,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-10 16:36:12,436 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:36:12,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:12,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:36:12,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,445 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:36:12,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:12,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:36:12,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:12,451 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:36:12,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-10 16:36:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:36:12,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:36:12,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2018-04-10 16:36:12,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:36:12,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:36:12,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:36:12,473 INFO L87 Difference]: Start difference. First operand 341 states and 387 transitions. Second operand 10 states. [2018-04-10 16:36:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:12,792 INFO L93 Difference]: Finished difference Result 483 states and 539 transitions. [2018-04-10 16:36:12,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:36:12,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-04-10 16:36:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:12,794 INFO L225 Difference]: With dead ends: 483 [2018-04-10 16:36:12,794 INFO L226 Difference]: Without dead ends: 483 [2018-04-10 16:36:12,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:36:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-10 16:36:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 399. [2018-04-10 16:36:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-10 16:36:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 459 transitions. [2018-04-10 16:36:12,798 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 459 transitions. Word has length 57 [2018-04-10 16:36:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:12,798 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 459 transitions. [2018-04-10 16:36:12,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:36:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 459 transitions. [2018-04-10 16:36:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 16:36:12,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:12,798 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:12,798 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash -496321924, now seen corresponding path program 1 times [2018-04-10 16:36:12,799 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:12,799 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:12,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:12,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:12,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:12,804 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:36:12,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:36:12,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:36:12,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:12,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:36:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:36:12,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:36:12,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 16:36:12,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:36:12,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:36:12,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=18, Unknown=2, NotChecked=0, Total=30 [2018-04-10 16:36:12,857 INFO L87 Difference]: Start difference. First operand 399 states and 459 transitions. Second operand 6 states. [2018-04-10 16:36:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:12,979 INFO L93 Difference]: Finished difference Result 410 states and 469 transitions. [2018-04-10 16:36:12,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:36:12,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-04-10 16:36:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:12,981 INFO L225 Difference]: With dead ends: 410 [2018-04-10 16:36:12,981 INFO L226 Difference]: Without dead ends: 378 [2018-04-10 16:36:12,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=26, Unknown=2, NotChecked=0, Total=42 [2018-04-10 16:36:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-10 16:36:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2018-04-10 16:36:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-10 16:36:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 436 transitions. [2018-04-10 16:36:12,986 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 436 transitions. Word has length 58 [2018-04-10 16:36:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:12,986 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 436 transitions. [2018-04-10 16:36:12,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:36:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 436 transitions. [2018-04-10 16:36:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 16:36:12,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:12,987 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:12,987 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash 935150629, now seen corresponding path program 1 times [2018-04-10 16:36:12,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:12,988 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:12,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:12,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:12,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:13,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:36:13,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:36:13,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:36:13,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:36:13,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:36:13,013 INFO L87 Difference]: Start difference. First operand 377 states and 436 transitions. Second operand 3 states. [2018-04-10 16:36:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:13,023 INFO L93 Difference]: Finished difference Result 603 states and 704 transitions. [2018-04-10 16:36:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:36:13,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-04-10 16:36:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:13,025 INFO L225 Difference]: With dead ends: 603 [2018-04-10 16:36:13,026 INFO L226 Difference]: Without dead ends: 603 [2018-04-10 16:36:13,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:36:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-04-10 16:36:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 469. [2018-04-10 16:36:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-10 16:36:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 557 transitions. [2018-04-10 16:36:13,033 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 557 transitions. Word has length 63 [2018-04-10 16:36:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:13,033 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 557 transitions. [2018-04-10 16:36:13,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:36:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 557 transitions. [2018-04-10 16:36:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 16:36:13,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:13,034 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:13,035 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 992408931, now seen corresponding path program 1 times [2018-04-10 16:36:13,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:13,035 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:13,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:13,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:13,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:13,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:13,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:36:13,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:36:13,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:36:13,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:36:13,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:36:13,071 INFO L87 Difference]: Start difference. First operand 469 states and 557 transitions. Second operand 6 states. [2018-04-10 16:36:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:13,171 INFO L93 Difference]: Finished difference Result 447 states and 520 transitions. [2018-04-10 16:36:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:36:13,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-04-10 16:36:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:13,172 INFO L225 Difference]: With dead ends: 447 [2018-04-10 16:36:13,172 INFO L226 Difference]: Without dead ends: 447 [2018-04-10 16:36:13,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:36:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-04-10 16:36:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 372. [2018-04-10 16:36:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-04-10 16:36:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 425 transitions. [2018-04-10 16:36:13,178 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 425 transitions. Word has length 63 [2018-04-10 16:36:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:13,179 INFO L459 AbstractCegarLoop]: Abstraction has 372 states and 425 transitions. [2018-04-10 16:36:13,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:36:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 425 transitions. [2018-04-10 16:36:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:36:13,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:13,179 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:13,180 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1982567314, now seen corresponding path program 1 times [2018-04-10 16:36:13,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:13,180 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:13,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:13,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:13,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:13,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:13,224 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:36:13,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:36:13,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:36:13,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:36:13,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:36:13,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:36:13,225 INFO L87 Difference]: Start difference. First operand 372 states and 425 transitions. Second operand 5 states. [2018-04-10 16:36:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:13,294 INFO L93 Difference]: Finished difference Result 404 states and 459 transitions. [2018-04-10 16:36:13,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:36:13,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-04-10 16:36:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:13,296 INFO L225 Difference]: With dead ends: 404 [2018-04-10 16:36:13,296 INFO L226 Difference]: Without dead ends: 404 [2018-04-10 16:36:13,296 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:36:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-10 16:36:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 380. [2018-04-10 16:36:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-10 16:36:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 433 transitions. [2018-04-10 16:36:13,301 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 433 transitions. Word has length 65 [2018-04-10 16:36:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:13,302 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 433 transitions. [2018-04-10 16:36:13,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:36:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 433 transitions. [2018-04-10 16:36:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:36:13,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:13,303 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:13,303 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1390252947, now seen corresponding path program 1 times [2018-04-10 16:36:13,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:13,303 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:13,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:13,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:13,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:13,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:13,316 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:36:13,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:36:13,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:36:13,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:13,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:36:13,349 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:36:13,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,355 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:36:13,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:36:13,379 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:36:13,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 10 treesize of output 9 [2018-04-10 16:36:13,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,389 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:36:13,391 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:36:13,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-10 16:36:13,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,423 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:36:13,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:36:13,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-04-10 16:36:13,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-10 16:36:13,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:36:13,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-10 16:36:13,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:36:13,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,507 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:36:13,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:50 [2018-04-10 16:36:13,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-10 16:36:13,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:36:13,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-10 16:36:13,641 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:36:13,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,668 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:36:13,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:72 [2018-04-10 16:36:13,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2018-04-10 16:36:13,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:36:13,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-10 16:36:13,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:13,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:36:13,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:13,792 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:36:13,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:95 [2018-04-10 16:36:15,919 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:36:15,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:15,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-04-10 16:36:15,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:15,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:15,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:15,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2018-04-10 16:36:15,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:15,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:15,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:36:15,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:15,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:15,974 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:36:15,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:15,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:36:15,976 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:15,983 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:15,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:36:15,984 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:15,987 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:15,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:15,996 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:123, output treesize:7 [2018-04-10 16:36:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:16,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:36:16,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:36:16,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:36:16,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:36:16,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=176, Unknown=3, NotChecked=0, Total=210 [2018-04-10 16:36:16,052 INFO L87 Difference]: Start difference. First operand 380 states and 433 transitions. Second operand 15 states. [2018-04-10 16:36:38,808 WARN L148 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-10 16:36:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:41,976 INFO L93 Difference]: Finished difference Result 705 states and 782 transitions. [2018-04-10 16:36:41,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:36:41,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-04-10 16:36:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:41,978 INFO L225 Difference]: With dead ends: 705 [2018-04-10 16:36:41,978 INFO L226 Difference]: Without dead ends: 705 [2018-04-10 16:36:41,979 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=222, Invalid=894, Unknown=6, NotChecked=0, Total=1122 [2018-04-10 16:36:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-04-10 16:36:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 413. [2018-04-10 16:36:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-10 16:36:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 468 transitions. [2018-04-10 16:36:41,983 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 468 transitions. Word has length 67 [2018-04-10 16:36:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:41,983 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 468 transitions. [2018-04-10 16:36:41,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:36:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 468 transitions. [2018-04-10 16:36:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 16:36:41,984 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:41,984 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:41,984 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -414101251, now seen corresponding path program 1 times [2018-04-10 16:36:41,984 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:41,984 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:41,985 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:41,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:41,985 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:41,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:41,995 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:36:41,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:36:41,996 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:36:41,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:42,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:36:42,017 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:36:42,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:36:42,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:42,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:42,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:36:42,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 16:36:42,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:36:42,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:36:42,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,086 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:36:42,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-10 16:36:42,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:42,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 16:36:42,134 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:36:42,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,149 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:36:42,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-04-10 16:36:42,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-10 16:36:42,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:42,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:36:42,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,188 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:36:42,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:56 [2018-04-10 16:36:42,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-04-10 16:36:42,253 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:42,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:36:42,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:42,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:36:42,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:42,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:42,272 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:15 [2018-04-10 16:36:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:42,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:36:42,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 16:36:42,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:36:42,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:36:42,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:36:42,316 INFO L87 Difference]: Start difference. First operand 413 states and 468 transitions. Second operand 14 states. [2018-04-10 16:36:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:43,278 INFO L93 Difference]: Finished difference Result 742 states and 825 transitions. [2018-04-10 16:36:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:36:43,278 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-04-10 16:36:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:43,280 INFO L225 Difference]: With dead ends: 742 [2018-04-10 16:36:43,280 INFO L226 Difference]: Without dead ends: 742 [2018-04-10 16:36:43,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:36:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-04-10 16:36:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 482. [2018-04-10 16:36:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-10 16:36:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 549 transitions. [2018-04-10 16:36:43,286 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 549 transitions. Word has length 69 [2018-04-10 16:36:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:43,286 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 549 transitions. [2018-04-10 16:36:43,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:36:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 549 transitions. [2018-04-10 16:36:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 16:36:43,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:43,287 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:43,288 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash -414101250, now seen corresponding path program 1 times [2018-04-10 16:36:43,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:43,288 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:43,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:43,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:43,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:43,306 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:36:43,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:36:43,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:36:43,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:43,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:36:43,331 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:36:43,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:36:43,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:36:43,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:36:43,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:36:43,390 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:36:43,392 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:36:43,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,420 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:36:43,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:36:43,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,436 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:36:43,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-04-10 16:36:43,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-10 16:36:43,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:36:43,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-10 16:36:43,494 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:36:43,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,508 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:36:43,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-04-10 16:36:43,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 16:36:43,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:36:43,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,556 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 74 treesize of output 64 [2018-04-10 16:36:43,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:36:43,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,573 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:36:43,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:82 [2018-04-10 16:36:43,661 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 73 treesize of output 56 [2018-04-10 16:36:43,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:43,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-10 16:36:43,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:36:43,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-10 16:36:43,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:43,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:36:43,688 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,692 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:43,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:36:43,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,694 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:43,699 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:36:43,699 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:99, output treesize:9 [2018-04-10 16:36:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:43,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:36:43,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 16:36:43,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:36:43,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:36:43,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=153, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:36:43,735 INFO L87 Difference]: Start difference. First operand 482 states and 549 transitions. Second operand 14 states. [2018-04-10 16:36:44,325 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-04-10 16:36:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:45,019 INFO L93 Difference]: Finished difference Result 704 states and 783 transitions. [2018-04-10 16:36:45,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:36:45,020 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-04-10 16:36:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:45,021 INFO L225 Difference]: With dead ends: 704 [2018-04-10 16:36:45,021 INFO L226 Difference]: Without dead ends: 704 [2018-04-10 16:36:45,021 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=558, Unknown=5, NotChecked=0, Total=702 [2018-04-10 16:36:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-04-10 16:36:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 528. [2018-04-10 16:36:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-10 16:36:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 607 transitions. [2018-04-10 16:36:45,026 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 607 transitions. Word has length 69 [2018-04-10 16:36:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:45,026 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 607 transitions. [2018-04-10 16:36:45,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:36:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 607 transitions. [2018-04-10 16:36:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 16:36:45,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:45,027 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:45,027 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:45,027 INFO L82 PathProgramCache]: Analyzing trace with hash -176123504, now seen corresponding path program 1 times [2018-04-10 16:36:45,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:45,027 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:45,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:45,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:45,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:45,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:45,048 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:36:45,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:36:45,048 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:36:45,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:45,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:36:45,108 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:36:45,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:36:45,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:45,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:45,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:36:45,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 16:36:45,143 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:36:45,145 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:36:45,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,153 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:36:45,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-10 16:36:45,180 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:36:45,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:36:45,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,195 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:36:45,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-10 16:36:45,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-10 16:36:45,239 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:36:45,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:45,255 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:36:45,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-10 16:36:51,280 WARN L151 SmtUtils]: Spent 2010ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-10 16:36:51,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:51,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:51,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:51,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-10 16:36:51,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,327 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:36:51,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-10 16:36:51,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-10 16:36:51,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:51,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-10 16:36:51,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:51,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-10 16:36:51,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:51,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 100 [2018-04-10 16:36:51,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:36:51,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,480 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:36:51,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:85 [2018-04-10 16:36:51,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2018-04-10 16:36:51,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:51,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:36:51,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:51,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:103 [2018-04-10 16:36:51,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2018-04-10 16:36:51,921 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:36:51,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:51,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:36:51,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:51,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-04-10 16:36:51,936 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:51,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:51,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:51,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:28 [2018-04-10 16:36:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:52,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:36:52,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:36:52,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:36:52,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:36:52,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=298, Unknown=2, NotChecked=0, Total=380 [2018-04-10 16:36:52,005 INFO L87 Difference]: Start difference. First operand 528 states and 607 transitions. Second operand 20 states. [2018-04-10 16:37:06,305 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-10 16:37:13,415 WARN L148 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 63 [2018-04-10 16:37:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:37:14,451 INFO L93 Difference]: Finished difference Result 762 states and 844 transitions. [2018-04-10 16:37:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:37:14,451 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-04-10 16:37:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:37:14,452 INFO L225 Difference]: With dead ends: 762 [2018-04-10 16:37:14,452 INFO L226 Difference]: Without dead ends: 762 [2018-04-10 16:37:14,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=363, Invalid=1190, Unknown=7, NotChecked=0, Total=1560 [2018-04-10 16:37:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-04-10 16:37:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 528. [2018-04-10 16:37:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-10 16:37:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 606 transitions. [2018-04-10 16:37:14,457 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 606 transitions. Word has length 72 [2018-04-10 16:37:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:37:14,457 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 606 transitions. [2018-04-10 16:37:14,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:37:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 606 transitions. [2018-04-10 16:37:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 16:37:14,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:37:14,458 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:37:14,458 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:37:14,458 INFO L82 PathProgramCache]: Analyzing trace with hash -176123503, now seen corresponding path program 1 times [2018-04-10 16:37:14,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:37:14,458 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:37:14,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:37:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:37:14,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:37:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:37:14,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:37:14,471 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:37:14,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:37:14,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:37:14,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:37:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:37:14,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:37:14,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:37:14,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:37:14,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:37:14,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:14,536 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:37:14,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:14,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:14,566 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:37:14,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-10 16:37:14,587 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:37:14,589 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:37:14,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:37:14,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:37:14,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,641 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:37:14,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2018-04-10 16:37:14,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-04-10 16:37:14,672 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:37:14,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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:37:14,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:37:14,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,702 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:37:14,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:81 [2018-04-10 16:37:14,741 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 109 treesize of output 95 [2018-04-10 16:37:14,743 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:37:14,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,766 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:37:14,769 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:37:14,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:14,784 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:37:14,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:111 [2018-04-10 16:37:18,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:18,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:18,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:18,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-10 16:37:18,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:18,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-10 16:37:18,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:18,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:18,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2018-04-10 16:37:18,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-04-10 16:37:18,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:18,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-04-10 16:37:18,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:18,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:18,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-04-10 16:37:18,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:18,942 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:37:18,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:18,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:18,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:18,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:106 [2018-04-10 16:37:19,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:19,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-04-10 16:37:19,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:37:19,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:19,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 126 [2018-04-10 16:37:19,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:37:19,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,121 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:37:19,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:132, output treesize:124 [2018-04-10 16:37:19,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 76 [2018-04-10 16:37:19,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:19,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:37:19,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2018-04-10 16:37:19,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:19,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:37:19,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:19,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:167, output treesize:151 [2018-04-10 16:37:19,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 112 [2018-04-10 16:37:19,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:19,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:37:19,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:37:19,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:19,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:19,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2018-04-10 16:37:19,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:19,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:19,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-04-10 16:37:19,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:19,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:37:19,968 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,975 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:37:19,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,978 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:19,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:37:19,978 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,980 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:19,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:19,990 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:179, output treesize:36 [2018-04-10 16:37:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:37:20,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:37:20,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:37:20,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:37:20,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:37:20,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=324, Unknown=2, NotChecked=0, Total=380 [2018-04-10 16:37:20,082 INFO L87 Difference]: Start difference. First operand 528 states and 606 transitions. Second operand 20 states. [2018-04-10 16:37:45,190 WARN L148 SmtUtils]: Spent 2044ms on a formula simplification that was a NOOP. DAG size: 86 [2018-04-10 16:37:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:37:51,106 INFO L93 Difference]: Finished difference Result 787 states and 869 transitions. [2018-04-10 16:37:51,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:37:51,106 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-04-10 16:37:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:37:51,107 INFO L225 Difference]: With dead ends: 787 [2018-04-10 16:37:51,107 INFO L226 Difference]: Without dead ends: 787 [2018-04-10 16:37:51,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=339, Invalid=1377, Unknown=6, NotChecked=0, Total=1722 [2018-04-10 16:37:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-04-10 16:37:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 528. [2018-04-10 16:37:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-10 16:37:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 603 transitions. [2018-04-10 16:37:51,114 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 603 transitions. Word has length 72 [2018-04-10 16:37:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:37:51,114 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 603 transitions. [2018-04-10 16:37:51,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:37:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 603 transitions. [2018-04-10 16:37:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 16:37:51,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:37:51,116 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:37:51,116 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:37:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1300098907, now seen corresponding path program 1 times [2018-04-10 16:37:51,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:37:51,116 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:37:51,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:37:51,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:37:51,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:37:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:37:51,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:37:51,132 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:37:51,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:37:51,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:37:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:37:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:37:51,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:37:51,184 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:37:51,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:37:51,200 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:37:51,202 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:37:51,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,214 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:37:51,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:37:51,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-10 16:37:51,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:37:51,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:35 [2018-04-10 16:37:51,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-10 16:37:51,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,273 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:37:51,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-10 16:37:51,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:37:51,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,310 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:37:51,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-04-10 16:37:51,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,363 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 35 treesize of output 40 [2018-04-10 16:37:51,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:37:51,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,385 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 51 treesize of output 52 [2018-04-10 16:37:51,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-10 16:37:51,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,403 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:37:51,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:85 [2018-04-10 16:37:51,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,427 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:37:51,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,440 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:37:51,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:87 [2018-04-10 16:37:51,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-10 16:37:51,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:37:51,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2018-04-10 16:37:51,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-10 16:37:51,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:51,539 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:103 [2018-04-10 16:37:51,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 134 [2018-04-10 16:37:51,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 145 [2018-04-10 16:37:51,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,652 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 90 treesize of output 89 [2018-04-10 16:37:51,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 130 [2018-04-10 16:37:51,705 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 128 treesize of output 127 [2018-04-10 16:37:51,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,774 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:37:51,774 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:158, output treesize:142 [2018-04-10 16:37:51,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 170 [2018-04-10 16:37:51,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,899 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 172 treesize of output 191 [2018-04-10 16:37:51,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:51,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:51,970 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:51,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2018-04-10 16:37:51,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:37:52,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 180 [2018-04-10 16:37:52,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,115 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 197 treesize of output 220 [2018-04-10 16:37:52,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:37:52,178 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:52,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 144 [2018-04-10 16:37:52,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,184 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:52,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 94 [2018-04-10 16:37:52,185 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,202 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:37:52,256 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:204, output treesize:328 [2018-04-10 16:37:52,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 199 [2018-04-10 16:37:52,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,688 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 55 [2018-04-10 16:37:52,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:37:52,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 88 [2018-04-10 16:37:52,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:52,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 60 [2018-04-10 16:37:52,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:52,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:52,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2018-04-10 16:37:52,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,773 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 54 treesize of output 38 [2018-04-10 16:37:52,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-10 16:37:52,785 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:52,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-04-10 16:37:52,792 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:52,802 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:37:52,802 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:263, output treesize:7 [2018-04-10 16:37:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:37:52,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:37:52,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 16:37:52,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:37:52,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:37:52,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=454, Unknown=1, NotChecked=0, Total=506 [2018-04-10 16:37:52,890 INFO L87 Difference]: Start difference. First operand 528 states and 603 transitions. Second operand 23 states. [2018-04-10 16:37:53,831 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 138 DAG size of output 133 [2018-04-10 16:37:54,206 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 181 DAG size of output 175 [2018-04-10 16:37:54,862 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 143 DAG size of output 138 [2018-04-10 16:37:55,477 WARN L151 SmtUtils]: Spent 518ms on a formula simplification. DAG size of input: 186 DAG size of output 182 [2018-04-10 16:37:56,104 WARN L151 SmtUtils]: Spent 479ms on a formula simplification. DAG size of input: 186 DAG size of output 179 [2018-04-10 16:37:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:37:57,952 INFO L93 Difference]: Finished difference Result 845 states and 944 transitions. [2018-04-10 16:37:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 16:37:57,952 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-04-10 16:37:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:37:57,954 INFO L225 Difference]: With dead ends: 845 [2018-04-10 16:37:57,954 INFO L226 Difference]: Without dead ends: 845 [2018-04-10 16:37:57,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=463, Invalid=2495, Unknown=12, NotChecked=0, Total=2970 [2018-04-10 16:37:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-04-10 16:37:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 553. [2018-04-10 16:37:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-04-10 16:37:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 630 transitions. [2018-04-10 16:37:57,958 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 630 transitions. Word has length 72 [2018-04-10 16:37:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:37:57,958 INFO L459 AbstractCegarLoop]: Abstraction has 553 states and 630 transitions. [2018-04-10 16:37:57,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:37:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 630 transitions. [2018-04-10 16:37:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 16:37:57,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:37:57,959 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:37:57,959 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:37:57,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1044785595, now seen corresponding path program 1 times [2018-04-10 16:37:57,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:37:57,959 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:37:57,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:37:57,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:37:57,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:37:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:37:57,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:37:57,968 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:37:57,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:37:57,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:37:57,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:37:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:37:57,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:37:57,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:57,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:57,993 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:37:57,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:57,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:57,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 16:37:58,017 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:37:58,019 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:37:58,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,034 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:37:58,035 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:37:58,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,045 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:37:58,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:39 [2018-04-10 16:37:58,070 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:37:58,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:37:58,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,089 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:37:58,090 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:37:58,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,102 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:37:58,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:65 [2018-04-10 16:37:58,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 91 [2018-04-10 16:37:58,167 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:58,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-04-10 16:37:58,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:37:58,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-10 16:37:58,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:37:58,349 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:58,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 76 [2018-04-10 16:37:58,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:58,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2018-04-10 16:37:58,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 126 [2018-04-10 16:37:58,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 101 [2018-04-10 16:37:58,384 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,473 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,476 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:58,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 112 [2018-04-10 16:37:58,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:37:58,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2018-04-10 16:37:58,481 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,492 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 16:37:58,521 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:103, output treesize:222 [2018-04-10 16:37:58,592 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 66 treesize of output 60 [2018-04-10 16:37:58,593 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:37:58,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 16:37:58,603 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 117 [2018-04-10 16:37:58,641 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 109 treesize of output 104 [2018-04-10 16:37:58,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,698 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 104 treesize of output 93 [2018-04-10 16:37:58,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,749 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 94 treesize of output 89 [2018-04-10 16:37:58,749 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,803 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 93 treesize of output 78 [2018-04-10 16:37:58,803 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2018-04-10 16:37:58,859 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,901 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:58,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:37:58,918 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:180, output treesize:109 [2018-04-10 16:37:59,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:59,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:37:59,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2018-04-10 16:37:59,069 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 47 treesize of output 42 [2018-04-10 16:37:59,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:59,094 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 38 treesize of output 27 [2018-04-10 16:37:59,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:59,105 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 39 treesize of output 28 [2018-04-10 16:37:59,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:59,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-10 16:37:59,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:59,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-04-10 16:37:59,129 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:37:59,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:37:59,138 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:37:59,138 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:56, output treesize:19 [2018-04-10 16:37:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 16:37:59,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:37:59,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-10 16:37:59,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:37:59,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:37:59,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:37:59,193 INFO L87 Difference]: Start difference. First operand 553 states and 630 transitions. Second operand 16 states. [2018-04-10 16:37:59,662 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 104 DAG size of output 81 [2018-04-10 16:38:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:38:00,382 INFO L93 Difference]: Finished difference Result 643 states and 714 transitions. [2018-04-10 16:38:00,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:38:00,382 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-04-10 16:38:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:38:00,383 INFO L225 Difference]: With dead ends: 643 [2018-04-10 16:38:00,383 INFO L226 Difference]: Without dead ends: 643 [2018-04-10 16:38:00,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2018-04-10 16:38:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-04-10 16:38:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 563. [2018-04-10 16:38:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-10 16:38:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 641 transitions. [2018-04-10 16:38:00,389 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 641 transitions. Word has length 74 [2018-04-10 16:38:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:38:00,389 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 641 transitions. [2018-04-10 16:38:00,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:38:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 641 transitions. [2018-04-10 16:38:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 16:38:00,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:38:00,390 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:38:00,390 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:38:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1044785594, now seen corresponding path program 1 times [2018-04-10 16:38:00,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:38:00,390 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:38:00,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:38:00,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:38:00,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:38:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:38:00,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:38:00,422 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:38:00,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:38:00,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:38:00,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:38:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:38:00,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:38:00,471 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:38:00,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:00,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:00,482 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:38:00,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-10 16:38:00,499 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:38:00,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, 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:38:00,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,512 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:38:00,514 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:38:00,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,522 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:38:00,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-10 16:38:00,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, 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:38:00,556 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:38:00,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,574 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:38:00,577 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:38:00,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,592 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:38:00,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-04-10 16:38:00,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 106 [2018-04-10 16:38:00,671 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 82 treesize of output 81 [2018-04-10 16:38:00,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 91 [2018-04-10 16:38:00,784 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 69 treesize of output 70 [2018-04-10 16:38:00,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:38:00,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-04-10 16:38:00,840 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:38:00,920 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:38:00,960 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 64 treesize of output 63 [2018-04-10 16:38:00,960 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:00,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:38:01,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 16:38:01,015 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:98, output treesize:259 [2018-04-10 16:38:01,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 87 [2018-04-10 16:38:01,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2018-04-10 16:38:01,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,204 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 79 treesize of output 68 [2018-04-10 16:38:01,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,254 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 68 treesize of output 63 [2018-04-10 16:38:01,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-04-10 16:38:01,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,374 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:38:01,375 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 71 treesize of output 56 [2018-04-10 16:38:01,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:38:01,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2018-04-10 16:38:01,479 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 45 treesize of output 36 [2018-04-10 16:38:01,479 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,515 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 32 treesize of output 25 [2018-04-10 16:38:01,515 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,545 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 25 treesize of output 20 [2018-04-10 16:38:01,545 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-10 16:38:01,586 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,602 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2018-04-10 16:38:01,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-10 16:38:01,609 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-04-10 16:38:01,624 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,638 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 37 treesize of output 28 [2018-04-10 16:38:01,638 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-04-10 16:38:01,653 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,662 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-04-10 16:38:01,688 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 13 [2018-04-10 16:38:01,688 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,696 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:38:01,696 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,702 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-10 16:38:01,718 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:38:01,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 16:38:01,719 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:38:01,731 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,735 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:01,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-10 16:38:01,747 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 10 variables, input treesize:146, output treesize:36 [2018-04-10 16:38:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 16:38:01,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:38:01,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:38:01,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:38:01,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:38:01,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=143, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:38:01,860 INFO L87 Difference]: Start difference. First operand 563 states and 641 transitions. Second operand 14 states. [2018-04-10 16:38:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:38:03,149 INFO L93 Difference]: Finished difference Result 653 states and 725 transitions. [2018-04-10 16:38:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:38:03,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-04-10 16:38:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:38:03,150 INFO L225 Difference]: With dead ends: 653 [2018-04-10 16:38:03,150 INFO L226 Difference]: Without dead ends: 653 [2018-04-10 16:38:03,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=740, Unknown=2, NotChecked=0, Total=992 [2018-04-10 16:38:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-04-10 16:38:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 570. [2018-04-10 16:38:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-04-10 16:38:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 647 transitions. [2018-04-10 16:38:03,154 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 647 transitions. Word has length 74 [2018-04-10 16:38:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:38:03,154 INFO L459 AbstractCegarLoop]: Abstraction has 570 states and 647 transitions. [2018-04-10 16:38:03,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:38:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 647 transitions. [2018-04-10 16:38:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 16:38:03,155 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:38:03,155 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:38:03,155 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:38:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash -556281749, now seen corresponding path program 1 times [2018-04-10 16:38:03,156 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:38:03,156 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:38:03,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:38:03,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:38:03,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:38:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:38:03,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:38:03,176 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:38:03,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:38:03,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:38:03,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:38:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:38:03,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:38:03,220 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:38:03,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:38:03,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,244 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:38:03,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 16:38:03,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:38:03,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:38:03,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,302 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:38:03,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-10 16:38:03,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 16:38:03,359 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:38:03,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:39 [2018-04-10 16:38:03,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-04-10 16:38:03,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:56 [2018-04-10 16:38:03,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-10 16:38:03,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:38:03,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,465 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:38:03,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:70 [2018-04-10 16:38:03,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:03,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-04-10 16:38:03,539 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:38:03,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,563 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:38:03,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:83 [2018-04-10 16:38:03,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 91 [2018-04-10 16:38:03,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-10 16:38:03,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:38:03,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:38:03,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:137, output treesize:123 [2018-04-10 16:38:07,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 75 [2018-04-10 16:38:07,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-10 16:38:07,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:07,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:38:07,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-04-10 16:38:07,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:38:07,799 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:38:07,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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:38:07,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:38:07,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:38:07,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:38:07,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:136, output treesize:28 [2018-04-10 16:38:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:38:07,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:38:07,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:38:07,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:38:07,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:38:07,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=298, Unknown=2, NotChecked=0, Total=380 [2018-04-10 16:38:07,902 INFO L87 Difference]: Start difference. First operand 570 states and 647 transitions. Second operand 20 states. [2018-04-10 16:38:26,825 WARN L151 SmtUtils]: Spent 4104ms on a formula simplification. DAG size of input: 74 DAG size of output 72 [2018-04-10 16:38:36,941 WARN L151 SmtUtils]: Spent 4068ms on a formula simplification. DAG size of input: 70 DAG size of output 68 Received shutdown request... [2018-04-10 16:38:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:38:47,548 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:38:47,551 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:38:47,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:38:47 BoogieIcfgContainer [2018-04-10 16:38:47,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:38:47,552 INFO L168 Benchmark]: Toolchain (without parser) took 211690.05 ms. Allocated memory was 405.8 MB in the beginning and 737.7 MB in the end (delta: 331.9 MB). Free memory was 339.7 MB in the beginning and 552.4 MB in the end (delta: -212.7 MB). Peak memory consumption was 119.2 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:47,553 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 405.8 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:38:47,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.07 ms. Allocated memory is still 405.8 MB. Free memory was 338.3 MB in the beginning and 311.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:47,553 INFO L168 Benchmark]: Boogie Preprocessor took 54.97 ms. Allocated memory is still 405.8 MB. Free memory was 311.8 MB in the beginning and 307.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:47,553 INFO L168 Benchmark]: RCFGBuilder took 579.74 ms. Allocated memory was 405.8 MB in the beginning and 618.1 MB in the end (delta: 212.3 MB). Free memory was 307.8 MB in the beginning and 528.0 MB in the end (delta: -220.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:47,554 INFO L168 Benchmark]: TraceAbstraction took 210770.00 ms. Allocated memory was 618.1 MB in the beginning and 737.7 MB in the end (delta: 119.5 MB). Free memory was 528.0 MB in the beginning and 552.4 MB in the end (delta: -24.4 MB). Peak memory consumption was 95.2 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:47,554 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 405.8 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 282.07 ms. Allocated memory is still 405.8 MB. Free memory was 338.3 MB in the beginning and 311.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.97 ms. Allocated memory is still 405.8 MB. Free memory was 311.8 MB in the beginning and 307.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 579.74 ms. Allocated memory was 405.8 MB in the beginning and 618.1 MB in the end (delta: 212.3 MB). Free memory was 307.8 MB in the beginning and 528.0 MB in the end (delta: -220.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 210770.00 ms. Allocated memory was 618.1 MB in the beginning and 737.7 MB in the end (delta: 119.5 MB). Free memory was 528.0 MB in the beginning and 552.4 MB in the end (delta: -24.4 MB). Peak memory consumption was 95.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (570states) and interpolant automaton (currently 25 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 63 error locations. TIMEOUT Result, 210.7s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 165.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5809 SDtfs, 15931 SDslu, 24925 SDs, 0 SdLazy, 18773 SolverSat, 940 SolverUnsat, 141 SolverUnknown, 0 SolverNotchecked, 64.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1510 GetRequests, 917 SyntacticMatches, 7 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2567 ImplicationChecksByTransitivity, 131.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=35, 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, 35 MinimizatonAttempts, 4097 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 43.8s InterpolantComputationTime, 2812 NumberOfCodeBlocks, 2812 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1699 ConstructedInterpolants, 489 QuantifiedInterpolants, 3482087 SizeOfPredicates, 245 NumberOfNonLiveVariables, 3665 ConjunctsInSsa, 582 ConjunctsInUnsatCore, 37 InterpolantComputations, 26 PerfectInterpolantSequences, 39/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-38-47-559.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-38-47-559.csv Completed graceful shutdown