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_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:31:42,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:31:42,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:31:42,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:31:42,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:31:42,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:31:42,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:31:42,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:31:42,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:31:42,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:31:42,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:31:42,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:31:42,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:31:42,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:31:42,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:31:42,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:31:42,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:31:42,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:31:42,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:31:42,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:31:42,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:31:42,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:31:42,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:31:42,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:31:42,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:31:42,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:31:42,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:31:42,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:31:42,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:31:42,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:31:42,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:31:42,419 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-10 14:31:42,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:31:42,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:31:42,432 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:31:42,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:31:42,432 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:31:42,433 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:31:42,433 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:31:42,433 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:31:42,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:31:42,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:31:42,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:31:42,433 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:31:42,434 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:31:42,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:31:42,434 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:31:42,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:31:42,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:31:42,434 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:31:42,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:31:42,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:31:42,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:31:42,435 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:31:42,435 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:31:42,435 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:31:42,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:31:42,473 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:31:42,477 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:31:42,479 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:31:42,480 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:31:42,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,767 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1f34ab8ab [2018-04-10 14:31:42,933 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:31:42,933 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:31:42,934 INFO L168 CDTParser]: Scanning sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,942 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:31:42,942 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:31:42,943 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:31:42,943 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,943 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:31:42,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,952 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,953 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:42,967 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1f34ab8ab [2018-04-10 14:31:42,970 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:31:42,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:31:42,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:31:42,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:31:42,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:31:42,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:31:42" (1/1) ... [2018-04-10 14:31:42,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4929f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:42, skipping insertion in model container [2018-04-10 14:31:42,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:31:42" (1/1) ... [2018-04-10 14:31:42,989 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:31:43,015 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:31:43,148 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:31:43,186 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:31:43,193 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:31:43,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43 WrapperNode [2018-04-10 14:31:43,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:31:43,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:31:43,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:31:43,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:31:43,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (1/1) ... [2018-04-10 14:31:43,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (1/1) ... [2018-04-10 14:31:43,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (1/1) ... [2018-04-10 14:31:43,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (1/1) ... [2018-04-10 14:31:43,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (1/1) ... [2018-04-10 14:31:43,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (1/1) ... [2018-04-10 14:31:43,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (1/1) ... [2018-04-10 14:31:43,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:31:43,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:31:43,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:31:43,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:31:43,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (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 14:31:43,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:31:43,353 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:31:43,353 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:31:43,353 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:31:43,354 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:31:43,355 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:31:43,356 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:31:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:31:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:31:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:31:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:31:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:31:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:31:43,689 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:31:43,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:31:43 BoogieIcfgContainer [2018-04-10 14:31:43,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:31:43,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:31:43,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:31:43,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:31:43,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:31:42" (1/3) ... [2018-04-10 14:31:43,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5284da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:31:43, skipping insertion in model container [2018-04-10 14:31:43,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:31:43" (2/3) ... [2018-04-10 14:31:43,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5284da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:31:43, skipping insertion in model container [2018-04-10 14:31:43,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:31:43" (3/3) ... [2018-04-10 14:31:43,695 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:31:43,701 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:31:43,706 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-04-10 14:31:43,731 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:31:43,731 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:31:43,732 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:31:43,732 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:31:43,732 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:31:43,732 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:31:43,732 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:31:43,732 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:31:43,732 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:31:43,732 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:31:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-04-10 14:31:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:31:43,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:43,750 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:43,751 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash -659694479, now seen corresponding path program 1 times [2018-04-10 14:31:43,755 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:43,755 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:43,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:43,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:43,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:43,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:43,867 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 14:31:43,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:43,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:31:43,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:31:43,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:31:43,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:31:43,881 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2018-04-10 14:31:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:44,056 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-04-10 14:31:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:31:44,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:31:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:44,064 INFO L225 Difference]: With dead ends: 141 [2018-04-10 14:31:44,065 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 14:31:44,066 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 14:31:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 14:31:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-10 14:31:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 14:31:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-10 14:31:44,099 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 8 [2018-04-10 14:31:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:44,099 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-10 14:31:44,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:31:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-10 14:31:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:31:44,100 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:44,100 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:44,100 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash -659694478, now seen corresponding path program 1 times [2018-04-10 14:31:44,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:44,101 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:44,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:44,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:44,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:44,168 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 14:31:44,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:44,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:31:44,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:31:44,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:31:44,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:31:44,170 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-04-10 14:31:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:44,281 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-04-10 14:31:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:31:44,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:31:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:44,283 INFO L225 Difference]: With dead ends: 135 [2018-04-10 14:31:44,283 INFO L226 Difference]: Without dead ends: 135 [2018-04-10 14:31:44,284 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 14:31:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-10 14:31:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-04-10 14:31:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 14:31:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-10 14:31:44,291 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-10 14:31:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:44,291 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-10 14:31:44,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:31:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-10 14:31:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:31:44,292 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:44,292 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:44,292 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash -202425566, now seen corresponding path program 1 times [2018-04-10 14:31:44,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:44,293 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:44,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:44,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:44,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:44,352 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 14:31:44,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:44,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:31:44,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:31:44,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:31:44,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:31:44,353 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2018-04-10 14:31:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:44,446 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-04-10 14:31:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:31:44,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 14:31:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:44,447 INFO L225 Difference]: With dead ends: 133 [2018-04-10 14:31:44,447 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 14:31:44,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:31:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 14:31:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2018-04-10 14:31:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-10 14:31:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-04-10 14:31:44,453 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 15 [2018-04-10 14:31:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:44,453 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-04-10 14:31:44,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:31:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-04-10 14:31:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:31:44,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:44,453 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:44,453 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash -202425565, now seen corresponding path program 1 times [2018-04-10 14:31:44,454 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:44,454 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:44,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:44,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:44,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:44,516 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 14:31:44,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:44,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:31:44,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:31:44,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:31:44,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:31:44,518 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 5 states. [2018-04-10 14:31:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:44,666 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-10 14:31:44,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:31:44,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-10 14:31:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:44,667 INFO L225 Difference]: With dead ends: 156 [2018-04-10 14:31:44,667 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 14:31:44,667 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 14:31:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 14:31:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2018-04-10 14:31:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 14:31:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-10 14:31:44,671 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-04-10 14:31:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:44,671 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-10 14:31:44,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:31:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-10 14:31:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:31:44,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:44,672 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:44,672 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash -325956996, now seen corresponding path program 1 times [2018-04-10 14:31:44,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:44,672 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:44,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:44,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:44,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:44,732 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 14:31:44,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:44,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:31:44,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:31:44,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:31:44,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:31:44,733 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2018-04-10 14:31:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:44,944 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-10 14:31:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:31:44,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-10 14:31:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:44,945 INFO L225 Difference]: With dead ends: 216 [2018-04-10 14:31:44,945 INFO L226 Difference]: Without dead ends: 216 [2018-04-10 14:31:44,946 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 14:31:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-10 14:31:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 124. [2018-04-10 14:31:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-10 14:31:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-04-10 14:31:44,950 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 18 [2018-04-10 14:31:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:44,950 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-04-10 14:31:44,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:31:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-04-10 14:31:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:31:44,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:44,951 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:44,951 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:44,951 INFO L82 PathProgramCache]: Analyzing trace with hash -325956997, now seen corresponding path program 1 times [2018-04-10 14:31:44,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:44,952 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:44,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:44,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:44,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:44,993 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 14:31:44,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:44,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:31:44,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:31:44,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:31:44,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:31:44,994 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2018-04-10 14:31:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:45,133 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-10 14:31:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:31:45,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-10 14:31:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:45,134 INFO L225 Difference]: With dead ends: 211 [2018-04-10 14:31:45,134 INFO L226 Difference]: Without dead ends: 211 [2018-04-10 14:31:45,135 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 14:31:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-10 14:31:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2018-04-10 14:31:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 14:31:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-04-10 14:31:45,140 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2018-04-10 14:31:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:45,140 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-04-10 14:31:45,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:31:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-04-10 14:31:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:31:45,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:45,141 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 14:31:45,141 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:45,141 INFO L82 PathProgramCache]: Analyzing trace with hash -765015574, now seen corresponding path program 1 times [2018-04-10 14:31:45,141 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:45,141 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:45,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:45,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:45,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:45,182 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 14:31:45,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:45,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:31:45,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:31:45,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:31:45,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:31:45,183 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-04-10 14:31:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:45,357 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2018-04-10 14:31:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:31:45,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-10 14:31:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:45,357 INFO L225 Difference]: With dead ends: 224 [2018-04-10 14:31:45,358 INFO L226 Difference]: Without dead ends: 224 [2018-04-10 14:31:45,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:31:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-10 14:31:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 122. [2018-04-10 14:31:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-10 14:31:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-04-10 14:31:45,362 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 26 [2018-04-10 14:31:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:45,362 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-04-10 14:31:45,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:31:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-04-10 14:31:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:31:45,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:45,363 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 14:31:45,363 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash -765015573, now seen corresponding path program 1 times [2018-04-10 14:31:45,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:45,364 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:45,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:45,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:45,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:45,420 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 14:31:45,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:45,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:31:45,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:31:45,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:31:45,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:31:45,422 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-04-10 14:31:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:45,585 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2018-04-10 14:31:45,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:31:45,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-10 14:31:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:45,586 INFO L225 Difference]: With dead ends: 217 [2018-04-10 14:31:45,586 INFO L226 Difference]: Without dead ends: 217 [2018-04-10 14:31:45,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:31:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-10 14:31:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 112. [2018-04-10 14:31:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-10 14:31:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-04-10 14:31:45,590 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 26 [2018-04-10 14:31:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:45,590 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-04-10 14:31:45,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:31:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-04-10 14:31:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 14:31:45,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:45,591 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] [2018-04-10 14:31:45,591 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:45,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1849046283, now seen corresponding path program 1 times [2018-04-10 14:31:45,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:45,592 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:45,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:45,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:45,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:45,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 14:31:45,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:45,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:31:45,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:31:45,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:31:45,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:31:45,628 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2018-04-10 14:31:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:45,715 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-04-10 14:31:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:31:45,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-10 14:31:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:45,716 INFO L225 Difference]: With dead ends: 131 [2018-04-10 14:31:45,716 INFO L226 Difference]: Without dead ends: 131 [2018-04-10 14:31:45,717 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 14:31:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-10 14:31:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-04-10 14:31:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-10 14:31:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-04-10 14:31:45,719 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 27 [2018-04-10 14:31:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:45,720 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-04-10 14:31:45,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:31:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-04-10 14:31:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 14:31:45,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:45,720 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 14:31:45,721 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1472510335, now seen corresponding path program 1 times [2018-04-10 14:31:45,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:45,721 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:45,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:45,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:45,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:45,784 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 14:31:45,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:45,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:31:45,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:31:45,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:31:45,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:31:45,786 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 5 states. [2018-04-10 14:31:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:45,864 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-10 14:31:45,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:31:45,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 14:31:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:45,865 INFO L225 Difference]: With dead ends: 120 [2018-04-10 14:31:45,865 INFO L226 Difference]: Without dead ends: 120 [2018-04-10 14:31:45,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:31:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-10 14:31:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-04-10 14:31:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-10 14:31:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-04-10 14:31:45,868 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 28 [2018-04-10 14:31:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:45,868 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-04-10 14:31:45,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:31:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-04-10 14:31:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 14:31:45,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:45,869 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] [2018-04-10 14:31:45,869 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1101576030, now seen corresponding path program 1 times [2018-04-10 14:31:45,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:45,870 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:45,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:45,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:45,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:45,926 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 14:31:45,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:45,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:31:45,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:31:45,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:31:45,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:31:45,927 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2018-04-10 14:31:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:46,032 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-04-10 14:31:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:31:46,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-04-10 14:31:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:46,033 INFO L225 Difference]: With dead ends: 131 [2018-04-10 14:31:46,033 INFO L226 Difference]: Without dead ends: 116 [2018-04-10 14:31:46,033 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 14:31:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-10 14:31:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-04-10 14:31:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-10 14:31:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-04-10 14:31:46,036 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 34 [2018-04-10 14:31:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:46,036 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-04-10 14:31:46,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:31:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-04-10 14:31:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 14:31:46,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:46,037 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] [2018-04-10 14:31:46,037 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738935, now seen corresponding path program 1 times [2018-04-10 14:31:46,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:46,038 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:46,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:46,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:46,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:46,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:46,187 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 14:31:46,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:46,188 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:46,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:46,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:46,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:46,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:46,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 14:31:46,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:31:46,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:46,318 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 14:31:46,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,335 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 14:31:46,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:31:46,389 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 37 treesize of output 33 [2018-04-10 14:31:46,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 12 treesize of output 11 [2018-04-10 14:31:46,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,401 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 14:31:46,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-10 14:31:46,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-10 14:31:46,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 14:31:46,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,477 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 14:31:46,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:46,483 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 14:31:46,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-10 14:31:46,543 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 14:31:46,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:46,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-04-10 14:31:46,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:31:46,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:31:46,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:31:46,564 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 21 states. [2018-04-10 14:31:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:47,131 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-04-10 14:31:47,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:31:47,131 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-04-10 14:31:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:47,132 INFO L225 Difference]: With dead ends: 212 [2018-04-10 14:31:47,132 INFO L226 Difference]: Without dead ends: 212 [2018-04-10 14:31:47,133 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:31:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-10 14:31:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 146. [2018-04-10 14:31:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-10 14:31:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-04-10 14:31:47,139 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 45 [2018-04-10 14:31:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:47,139 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-04-10 14:31:47,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:31:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-04-10 14:31:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 14:31:47,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:47,140 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] [2018-04-10 14:31:47,140 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738936, now seen corresponding path program 1 times [2018-04-10 14:31:47,141 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:47,141 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:47,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:47,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:47,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:47,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:47,323 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 14:31:47,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:47,323 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:47,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:47,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:47,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:47,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:47,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 14:31:47,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,380 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 14:31:47,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:31:47,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:47,401 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 14:31:47,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:47,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:31:47,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,426 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 14:31:47,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:31:47,489 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 52 [2018-04-10 14:31:47,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:47,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,512 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 27 treesize of output 28 [2018-04-10 14:31:47,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, 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 14:31:47,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,525 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 14:31:47,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-10 14:31:47,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-10 14:31:47,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-10 14:31:47,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,625 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 14:31:47,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,639 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 22 treesize of output 20 [2018-04-10 14:31:47,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:31:47,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,648 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 14:31:47,648 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,650 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:47,653 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 14:31:47,654 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-10 14:31:47,690 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 14:31:47,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:47,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-10 14:31:47,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:31:47,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:31:47,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:31:47,719 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 17 states. [2018-04-10 14:31:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:48,366 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2018-04-10 14:31:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:31:48,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-04-10 14:31:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:48,366 INFO L225 Difference]: With dead ends: 218 [2018-04-10 14:31:48,367 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 14:31:48,367 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:31:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 14:31:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-04-10 14:31:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-10 14:31:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-04-10 14:31:48,369 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 45 [2018-04-10 14:31:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:48,369 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-04-10 14:31:48,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:31:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-04-10 14:31:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 14:31:48,370 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:48,370 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:48,370 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1481333305, now seen corresponding path program 1 times [2018-04-10 14:31:48,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:48,370 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:48,371 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:48,371 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:48,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:48,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:48,781 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:48,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:48,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:48,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:48,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:48,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:48,845 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 14:31:48,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:31:48,864 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 14:31:48,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:48,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,872 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 14:31:48,873 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 14:31:48,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,879 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 14:31:48,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:31:48,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:48,925 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 14:31:48,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:48,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:48,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 14:31:48,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 14:31:48,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:48,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-04-10 14:31:48,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-04-10 14:31:48,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,008 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 21 treesize of output 14 [2018-04-10 14:31:49,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:31:49,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 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 14:31:49,022 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-04-10 14:31:49,130 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 14:31:49,132 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 14:31:49,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,140 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 32 treesize of output 21 [2018-04-10 14:31:49,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,153 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 22 treesize of output 20 [2018-04-10 14:31:49,155 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 14:31:49,155 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,158 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 14:31:49,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,159 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:49,163 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 14:31:49,163 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-04-10 14:31:49,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:31:49,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-10 14:31:49,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:49,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:49,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:49,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 14:31:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:49,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:49,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2018-04-10 14:31:49,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:31:49,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:31:49,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=962, Unknown=1, NotChecked=0, Total=1056 [2018-04-10 14:31:49,303 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 33 states. [2018-04-10 14:31:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:50,794 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-04-10 14:31:50,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 14:31:50,826 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-10 14:31:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:50,827 INFO L225 Difference]: With dead ends: 214 [2018-04-10 14:31:50,827 INFO L226 Difference]: Without dead ends: 214 [2018-04-10 14:31:50,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=344, Invalid=2104, Unknown=2, NotChecked=0, Total=2450 [2018-04-10 14:31:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-10 14:31:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2018-04-10 14:31:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 14:31:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-04-10 14:31:50,829 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 49 [2018-04-10 14:31:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:50,829 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-04-10 14:31:50,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:31:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-04-10 14:31:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 14:31:50,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:50,830 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] [2018-04-10 14:31:50,830 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438270, now seen corresponding path program 1 times [2018-04-10 14:31:50,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:50,830 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:50,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:50,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:50,832 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:50,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:50,987 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 14:31:50,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:50,988 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:50,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:51,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:51,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:51,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:51,018 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 14:31:51,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:31:51,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:51,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, 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 14:31:51,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,043 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 14:31:51,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 14:31:51,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 20 [2018-04-10 14:31:51,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:31:51,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-10 14:31:51,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:51,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:51,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:31:51,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-04-10 14:31:51,105 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 26 treesize of output 25 [2018-04-10 14:31:51,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:31:51,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,114 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 14:31:51,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-04-10 14:31:51,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-10 14:31:51,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-10 14:31:51,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2018-04-10 14:31:51,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:51,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:51,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:51,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 [2018-04-10 14:31:51,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-04-10 14:31:51,317 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 21 [2018-04-10 14:31:51,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-04-10 14:31:51,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 14:31:51,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:51,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-10 14:31:51,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 14:31:51,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-10 14:31:51,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 14:31:51,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,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 5 treesize of output 1 [2018-04-10 14:31:51,408 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,410 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:51,414 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-04-10 14:31:51,428 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 14:31:51,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:51,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-04-10 14:31:51,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 14:31:51,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 14:31:51,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:31:51,446 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 23 states. [2018-04-10 14:31:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:52,277 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-04-10 14:31:52,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:31:52,278 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-04-10 14:31:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:52,278 INFO L225 Difference]: With dead ends: 247 [2018-04-10 14:31:52,278 INFO L226 Difference]: Without dead ends: 247 [2018-04-10 14:31:52,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:31:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-10 14:31:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 176. [2018-04-10 14:31:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-10 14:31:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-04-10 14:31:52,282 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 51 [2018-04-10 14:31:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:52,282 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-04-10 14:31:52,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 14:31:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-04-10 14:31:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 14:31:52,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:52,283 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] [2018-04-10 14:31:52,283 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438271, now seen corresponding path program 1 times [2018-04-10 14:31:52,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:52,284 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:52,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:52,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:52,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:52,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:52,485 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 14:31:52,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:52,486 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:52,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:52,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,520 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 14:31:52,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:31:52,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:52,545 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 14:31:52,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:52,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:52,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,560 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 14:31:52,560 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:31:52,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,612 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 14:31:52,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:52,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,629 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 14:31:52,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:52,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-10 14:31:52,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,692 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 14 treesize of output 21 [2018-04-10 14:31:52,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,706 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 14:31:52,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-04-10 14:31:52,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:52,754 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 14:31:52,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:31:52,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,782 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 30 treesize of output 36 [2018-04-10 14:31:52,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-10 14:31:52,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,797 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 14:31:52,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:66 [2018-04-10 14:31:52,873 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 115 treesize of output 90 [2018-04-10 14:31:52,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:31:52,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,901 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 35 treesize of output 36 [2018-04-10 14:31:52,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:31:52,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:52,918 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 14:31:52,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:101 [2018-04-10 14:31:53,005 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 98 treesize of output 61 [2018-04-10 14:31:53,007 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 14:31:53,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:53,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-10 14:31:53,032 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 14:31:53,051 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 27 treesize of output 16 [2018-04-10 14:31:53,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:53,059 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 14:31:53,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-10 14:31:53,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 14:31:53,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:53,079 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 14:31:53,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:53,080 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:53,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:31:53,087 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-04-10 14:31:53,143 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 14:31:53,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:53,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-04-10 14:31:53,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:31:53,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:31:53,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:31:53,172 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 31 states. [2018-04-10 14:31:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:54,688 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-04-10 14:31:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:31:54,688 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-04-10 14:31:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:54,690 INFO L225 Difference]: With dead ends: 305 [2018-04-10 14:31:54,690 INFO L226 Difference]: Without dead ends: 305 [2018-04-10 14:31:54,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=366, Invalid=2390, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 14:31:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-10 14:31:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 178. [2018-04-10 14:31:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-10 14:31:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-04-10 14:31:54,694 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 51 [2018-04-10 14:31:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:54,694 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-04-10 14:31:54,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:31:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-04-10 14:31:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:31:54,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:54,694 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] [2018-04-10 14:31:54,694 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1776041815, now seen corresponding path program 1 times [2018-04-10 14:31:54,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:54,695 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:54,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:54,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:54,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:31:54,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:54,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:31:54,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:31:54,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:31:54,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:31:54,752 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 6 states. [2018-04-10 14:31:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:54,825 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-04-10 14:31:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:31:54,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-10 14:31:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:54,825 INFO L225 Difference]: With dead ends: 142 [2018-04-10 14:31:54,825 INFO L226 Difference]: Without dead ends: 142 [2018-04-10 14:31:54,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:31:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-10 14:31:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-04-10 14:31:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:31:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-10 14:31:54,827 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 54 [2018-04-10 14:31:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:54,827 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-10 14:31:54,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:31:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-10 14:31:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 14:31:54,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:54,828 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:54,828 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1044886106, now seen corresponding path program 2 times [2018-04-10 14:31:54,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:54,828 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:54,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:54,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:54,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:54,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:54,977 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:54,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:31:55,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:31:55,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:31:55,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:55,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:55,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:55,059 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 14:31:55,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:31:55,087 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 14:31:55,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, 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 14:31:55,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,108 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 14:31:55,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:55,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,139 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 14:31:55,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2018-04-10 14:31:55,192 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 14:31:55,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:31:55,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,217 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 47 treesize of output 43 [2018-04-10 14:31:55,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:31:55,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-04-10 14:31:55,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:55,368 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:55,369 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 0 case distinctions, treesize of input 69 treesize of output 69 [2018-04-10 14:31:55,371 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:55,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-04-10 14:31:55,372 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 14:31:55,378 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:55,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:31:55,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:31:55,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:31:55,392 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:55,392 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-10 14:31:55,393 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 14:31:55,397 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 14:31:55,397 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,398 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:55,402 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 14:31:55,402 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-04-10 14:31:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:55,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:55,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2018-04-10 14:31:55,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:31:55,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:31:55,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=577, Unknown=3, NotChecked=0, Total=650 [2018-04-10 14:31:55,440 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 26 states. [2018-04-10 14:31:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:56,001 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-04-10 14:31:56,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:31:56,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-04-10 14:31:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:56,033 INFO L225 Difference]: With dead ends: 151 [2018-04-10 14:31:56,033 INFO L226 Difference]: Without dead ends: 126 [2018-04-10 14:31:56,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1237, Unknown=3, NotChecked=0, Total=1482 [2018-04-10 14:31:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-10 14:31:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-04-10 14:31:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-10 14:31:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-04-10 14:31:56,035 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-04-10 14:31:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:56,036 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-04-10 14:31:56,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:31:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-04-10 14:31:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 14:31:56,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:56,036 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:56,037 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070912, now seen corresponding path program 1 times [2018-04-10 14:31:56,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:56,037 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:56,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:56,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:31:56,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:56,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:56,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:56,284 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:56,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:56,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:56,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,315 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 14:31:56,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:31:56,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:56,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:31:56,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:56,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:31:56,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:31:56,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,421 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 26 treesize of output 31 [2018-04-10 14:31:56,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, 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 14:31:56,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,437 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 14:31:56,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:56,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-04-10 14:31:56,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,480 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 26 treesize of output 46 [2018-04-10 14:31:56,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-04-10 14:31:56,543 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 52 treesize of output 58 [2018-04-10 14:31:56,545 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 30 [2018-04-10 14:31:56,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:56,568 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 70 treesize of output 69 [2018-04-10 14:31:56,570 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 18 treesize of output 26 [2018-04-10 14:31:56,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,588 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 14:31:56,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-04-10 14:31:56,689 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 141 treesize of output 112 [2018-04-10 14:31:56,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:31:56,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-04-10 14:31:56,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:31:56,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,733 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 14:31:56,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:153, output treesize:121 [2018-04-10 14:31:56,843 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-04-10 14:31:56,846 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 14:31:56,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-04-10 14:31:56,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,878 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 14:31:56,878 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-10 14:31:56,988 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 85 treesize of output 50 [2018-04-10 14:31:56,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 14:31:56,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:56,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-10 14:31:56,997 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 14:31:57,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-10 14:31:57,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:57,006 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 14:31:57,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:31:57,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-10 14:31:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:57,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:57,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-04-10 14:31:57,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:31:57,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:31:57,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:31:57,100 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 35 states. [2018-04-10 14:31:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:57,987 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-04-10 14:31:57,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:31:57,987 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 55 [2018-04-10 14:31:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:57,987 INFO L225 Difference]: With dead ends: 161 [2018-04-10 14:31:57,988 INFO L226 Difference]: Without dead ends: 161 [2018-04-10 14:31:57,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=2026, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 14:31:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-10 14:31:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-04-10 14:31:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 14:31:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-10 14:31:57,990 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-04-10 14:31:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:57,990 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-10 14:31:57,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:31:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-10 14:31:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 14:31:57,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:57,991 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:57,991 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070911, now seen corresponding path program 1 times [2018-04-10 14:31:57,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:57,991 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:57,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:57,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:57,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:58,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:58,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:58,254 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:58,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:58,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:58,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:58,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:58,298 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 14:31:58,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:31:58,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:58,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:31:58,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:31:58,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 14:31:58,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,361 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 14:31:58,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-10 14:31:58,445 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 20 [2018-04-10 14:31:58,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:58,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,459 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 30 treesize of output 35 [2018-04-10 14:31:58,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:58,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:55 [2018-04-10 14:31:58,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:58,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:58,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:58,502 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 14:31:58,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,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, 2 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 14:31:58,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-04-10 14:31:58,558 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 14:31:58,561 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 18 treesize of output 19 [2018-04-10 14:31:58,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,578 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:58,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-04-10 14:31:58,582 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 27 treesize of output 23 [2018-04-10 14:31:58,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,595 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 14:31:58,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2018-04-10 14:31:58,679 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 147 treesize of output 118 [2018-04-10 14:31:58,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:31:58,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,705 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 123 treesize of output 119 [2018-04-10 14:31:58,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 20 treesize of output 19 [2018-04-10 14:31:58,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,723 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 14:31:58,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:115 [2018-04-10 14:31:58,873 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 145 treesize of output 98 [2018-04-10 14:31:58,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-10 14:31:58,876 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 14:31:58,888 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 54 treesize of output 21 [2018-04-10 14:31:58,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,897 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 14:31:58,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,904 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 14:31:58,914 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 30 treesize of output 32 [2018-04-10 14:31:58,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:31:58,916 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 14:31:58,922 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 14:31:58,922 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,925 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 14:31:58,925 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:58,930 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 14:31:58,930 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-04-10 14:31:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:58,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:58,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2018-04-10 14:31:58,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:31:58,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:31:58,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:31:58,975 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 31 states. [2018-04-10 14:31:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:59,768 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-04-10 14:31:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 14:31:59,768 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-04-10 14:31:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:59,768 INFO L225 Difference]: With dead ends: 159 [2018-04-10 14:31:59,768 INFO L226 Difference]: Without dead ends: 159 [2018-04-10 14:31:59,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:31:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-10 14:31:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-04-10 14:31:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 14:31:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-10 14:31:59,771 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-04-10 14:31:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:59,771 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-10 14:31:59,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:31:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-10 14:31:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 14:31:59,772 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:59,772 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:59,772 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash -817344126, now seen corresponding path program 3 times [2018-04-10 14:31:59,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:59,772 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:59,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:59,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:59,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:59,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:59,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:59,951 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:31:59,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:31:59,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:31:59,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:31:59,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:59,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:31:59,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:59,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:59,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 14:32:00,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:00,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:00,017 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 14:32:00,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:32:00,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, 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 14:32:00,036 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 14:32:00,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,041 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 14:32:00,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-10 14:32:00,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:00,090 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 27 treesize of output 28 [2018-04-10 14:32:00,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 14:32:00,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-10 14:32:00,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:00,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:00,121 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 14:32:00,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-04-10 14:32:00,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:00,153 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 34 treesize of output 33 [2018-04-10 14:32:00,159 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 14 treesize of output 7 [2018-04-10 14:32:00,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,167 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 14:32:00,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-04-10 14:32:00,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-10 14:32:00,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-10 14:32:00,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-04-10 14:32:00,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:32:00,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:32:00,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:32:00,289 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:81 [2018-04-10 14:32:00,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2018-04-10 14:32:00,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 14:32:00,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:32:00,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-10 14:32:00,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,463 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 30 treesize of output 25 [2018-04-10 14:32:00,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-10 14:32:00,483 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-10 14:32:00,484 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,499 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 16 [2018-04-10 14:32:00,499 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,517 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 42 treesize of output 30 [2018-04-10 14:32:00,518 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 14:32:00,518 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 14:32:00,522 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,526 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:00,533 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-04-10 14:32:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:32:00,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:32:00,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2018-04-10 14:32:00,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:32:00,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:32:00,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:32:00,569 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 31 states. [2018-04-10 14:32:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:32:01,754 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-04-10 14:32:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:32:01,754 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-04-10 14:32:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:32:01,755 INFO L225 Difference]: With dead ends: 194 [2018-04-10 14:32:01,755 INFO L226 Difference]: Without dead ends: 194 [2018-04-10 14:32:01,755 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=409, Invalid=2243, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:32:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-10 14:32:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-04-10 14:32:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 14:32:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-04-10 14:32:01,758 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-04-10 14:32:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:32:01,758 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-04-10 14:32:01,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:32:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-04-10 14:32:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 14:32:01,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:32:01,759 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:32:01,759 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:32:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash -817344125, now seen corresponding path program 2 times [2018-04-10 14:32:01,759 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:32:01,759 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:32:01,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:32:01,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:32:01,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:32:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:32:01,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:32:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:32:02,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:32:02,161 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:32:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:32:02,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:32:02,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:32:02,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:32:02,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:32:02,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 14:32:02,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:32:02,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,287 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 14:32:02,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:32:02,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:32:02,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:32:02,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:32:02,413 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 14:32:02,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,422 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 14:32:02,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-04-10 14:32:02,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,504 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 14:32:02,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 14:32:02,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 14:32:02,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:32:02,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-04-10 14:32:02,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,572 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 14:32:02,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,584 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 14:32:02,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-10 14:32:02,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:32:02,624 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 62 treesize of output 61 [2018-04-10 14:32:02,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:32:02,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-10 14:32:02,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-10 14:32:02,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,669 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 14:32:02,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:61 [2018-04-10 14:32:02,755 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 113 treesize of output 88 [2018-04-10 14:32:02,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:32:02,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,777 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 35 treesize of output 36 [2018-04-10 14:32:02,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:32:02,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,790 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 14:32:02,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:96 [2018-04-10 14:32:02,873 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 96 treesize of output 59 [2018-04-10 14:32:02,875 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 14:32:02,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-10 14:32:02,888 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 14:32:02,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-10 14:32:02,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,906 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 14:32:02,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-10 14:32:02,918 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 14:32:02,918 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 14:32:02,931 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,932 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:32:02,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:32:02,937 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-04-10 14:32:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:32:03,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:32:03,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-04-10 14:32:03,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:32:03,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:32:03,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:32:03,031 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 30 states. [2018-04-10 14:32:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:32:04,022 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-04-10 14:32:04,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 14:32:04,023 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-04-10 14:32:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:32:04,023 INFO L225 Difference]: With dead ends: 200 [2018-04-10 14:32:04,023 INFO L226 Difference]: Without dead ends: 200 [2018-04-10 14:32:04,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=319, Invalid=1937, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:32:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-10 14:32:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-04-10 14:32:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 14:32:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-04-10 14:32:04,026 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-04-10 14:32:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:32:04,026 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-04-10 14:32:04,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:32:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-04-10 14:32:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:32:04,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:32:04,027 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] [2018-04-10 14:32:04,027 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:32:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 613514207, now seen corresponding path program 1 times [2018-04-10 14:32:04,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:32:04,027 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:32:04,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:32:04,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:32:04,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:32:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 14:32:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 14:32:04,059 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-10 14:32:04,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:32:04 BoogieIcfgContainer [2018-04-10 14:32:04,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:32:04,090 INFO L168 Benchmark]: Toolchain (without parser) took 21119.77 ms. Allocated memory was 403.2 MB in the beginning and 1.0 GB in the end (delta: 625.5 MB). Free memory was 341.0 MB in the beginning and 917.7 MB in the end (delta: -576.7 MB). Peak memory consumption was 48.8 MB. Max. memory is 5.3 GB. [2018-04-10 14:32:04,091 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:32:04,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.03 ms. Allocated memory is still 403.2 MB. Free memory was 339.7 MB in the beginning and 311.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-10 14:32:04,092 INFO L168 Benchmark]: Boogie Preprocessor took 42.28 ms. Allocated memory is still 403.2 MB. Free memory was 311.9 MB in the beginning and 309.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 14:32:04,092 INFO L168 Benchmark]: RCFGBuilder took 419.55 ms. Allocated memory was 403.2 MB in the beginning and 611.3 MB in the end (delta: 208.1 MB). Free memory was 309.3 MB in the beginning and 532.1 MB in the end (delta: -222.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-10 14:32:04,092 INFO L168 Benchmark]: TraceAbstraction took 20399.34 ms. Allocated memory was 611.3 MB in the beginning and 1.0 GB in the end (delta: 417.3 MB). Free memory was 532.1 MB in the beginning and 917.7 MB in the end (delta: -385.6 MB). Peak memory consumption was 31.7 MB. Max. memory is 5.3 GB. [2018-04-10 14:32:04,093 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.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 256.03 ms. Allocated memory is still 403.2 MB. Free memory was 339.7 MB in the beginning and 311.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.28 ms. Allocated memory is still 403.2 MB. Free memory was 311.9 MB in the beginning and 309.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 419.55 ms. Allocated memory was 403.2 MB in the beginning and 611.3 MB in the end (delta: 208.1 MB). Free memory was 309.3 MB in the beginning and 532.1 MB in the end (delta: -222.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20399.34 ms. Allocated memory was 611.3 MB in the beginning and 1.0 GB in the end (delta: 417.3 MB). Free memory was 532.1 MB in the beginning and 917.7 MB in the end (delta: -385.6 MB). Peak memory consumption was 31.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L996] FCALL list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L997] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L999] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1019] FCALL end->colour = BLACK VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1028] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1039] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] EXPR, FCALL end->colour VAL [end={11:0}, end->colour=0, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1035] end = end->next [L1038] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 49 error locations. UNSAFE Result, 20.3s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1581 SDtfs, 6258 SDslu, 8301 SDs, 0 SdLazy, 13513 SolverSat, 855 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 412 SyntacticMatches, 34 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=16, 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.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1088 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1281 ConstructedInterpolants, 241 QuantifiedInterpolants, 1709977 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1896 ConjunctsInSsa, 430 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 26/216 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-32-04-098.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-32-04-098.csv Received shutdown request...