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/dll-queue_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:04:08,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:04:08,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:04:08,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:04:08,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:04:08,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:04:08,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:04:08,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:04:08,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:04:08,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:04:08,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:04:08,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:04:08,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:04:08,590 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:04:08,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:04:08,593 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:04:08,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:04:08,596 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:04:08,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:04:08,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:04:08,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:04:08,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:04:08,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:04:08,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:04:08,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:04:08,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:04:08,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:04:08,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:04:08,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:04:08,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:04:08,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:04:08,604 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:04:08,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:04:08,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:04:08,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:04:08,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:04:08,618 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:04:08,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:04:08,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:04:08,618 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:04:08,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:04:08,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:04:08,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:04:08,619 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:04:08,619 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:04:08,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:04:08,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:04:08,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:04:08,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:04:08,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:04:08,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:04:08,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:04:08,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:04:08,620 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:04:08,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:04:08,621 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:04:08,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:04:08,658 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:04:08,661 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:04:08,663 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:04:08,663 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:04:08,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:08,966 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6d2459171 [2018-04-10 14:04:09,161 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:04:09,161 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:04:09,161 INFO L168 CDTParser]: Scanning dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,168 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:04:09,168 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:04:09,169 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:04:09,169 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,169 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:04:09,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__timer_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_short in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ino_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__loff_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__size_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__off_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_int in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__register_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__SLL in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__div_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____clock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____loff_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ushort in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ino_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____time_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____mode_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____dev_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fd_set in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_long in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__gid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_short in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__clock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__mode_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_long in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_char in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ulong in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_char in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____off64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__time_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__uid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__dev_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____pid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____timer_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____gid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__id_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____id_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____off_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__uint in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,179 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,179 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:09,255 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6d2459171 [2018-04-10 14:04:09,258 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:04:09,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:04:09,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:04:09,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:04:09,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:04:09,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ed9059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09, skipping insertion in model container [2018-04-10 14:04:09,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,280 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:04:09,307 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:04:09,450 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:04:09,491 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:04:09,496 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:04:09,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09 WrapperNode [2018-04-10 14:04:09,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:04:09,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:04:09,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:04:09,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:04:09,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (1/1) ... [2018-04-10 14:04:09,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:04:09,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:04:09,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:04:09,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:04:09,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (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:04:09,669 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:04:09,669 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:04:09,669 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:04:09,669 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:04:09,670 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:04:09,671 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:04:09,672 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:04:09,673 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:04:09,674 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:04:09,675 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:04:09,676 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:04:09,677 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:04:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:04:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:04:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:04:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:04:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:04:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:04:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:04:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:04:10,148 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:04:10,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:04:10 BoogieIcfgContainer [2018-04-10 14:04:10,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:04:10,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:04:10,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:04:10,152 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:04:10,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:04:09" (1/3) ... [2018-04-10 14:04:10,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544b1ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:04:10, skipping insertion in model container [2018-04-10 14:04:10,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:04:09" (2/3) ... [2018-04-10 14:04:10,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544b1ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:04:10, skipping insertion in model container [2018-04-10 14:04:10,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:04:10" (3/3) ... [2018-04-10 14:04:10,155 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:04:10,163 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:04:10,168 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2018-04-10 14:04:10,198 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:04:10,198 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:04:10,199 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:04:10,199 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:04:10,199 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:04:10,199 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:04:10,199 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:04:10,199 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:04:10,199 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:04:10,200 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:04:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-04-10 14:04:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:04:10,217 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:10,218 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:10,218 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1577217846, now seen corresponding path program 1 times [2018-04-10 14:04:10,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:10,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:10,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:10,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:10,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:10,322 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:04:10,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:10,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:04:10,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:04:10,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:04:10,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:04:10,341 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 4 states. [2018-04-10 14:04:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:10,517 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-04-10 14:04:10,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:04:10,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:04:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:10,528 INFO L225 Difference]: With dead ends: 177 [2018-04-10 14:04:10,529 INFO L226 Difference]: Without dead ends: 173 [2018-04-10 14:04:10,530 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:04:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-10 14:04:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2018-04-10 14:04:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-10 14:04:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2018-04-10 14:04:10,561 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 8 [2018-04-10 14:04:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:10,561 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2018-04-10 14:04:10,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:04:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2018-04-10 14:04:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:04:10,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:10,562 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:10,562 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:10,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1577217845, now seen corresponding path program 1 times [2018-04-10 14:04:10,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:10,562 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:10,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:10,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:10,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:10,614 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:04:10,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:10,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:04:10,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:04:10,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:04:10,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:04:10,616 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand 4 states. [2018-04-10 14:04:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:10,733 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-04-10 14:04:10,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:04:10,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:04:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:10,735 INFO L225 Difference]: With dead ends: 156 [2018-04-10 14:04:10,735 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 14:04:10,735 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:04:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 14:04:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2018-04-10 14:04:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 14:04:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-04-10 14:04:10,744 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 8 [2018-04-10 14:04:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:10,744 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-04-10 14:04:10,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:04:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-04-10 14:04:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 14:04:10,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:10,745 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:10,745 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1014420055, now seen corresponding path program 1 times [2018-04-10 14:04:10,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:10,746 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:10,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:10,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:10,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:10,811 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:04:10,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:10,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:04:10,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:04:10,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:04:10,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:04:10,813 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 4 states. [2018-04-10 14:04:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:10,944 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-10 14:04:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:04:10,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-10 14:04:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:10,945 INFO L225 Difference]: With dead ends: 158 [2018-04-10 14:04:10,945 INFO L226 Difference]: Without dead ends: 158 [2018-04-10 14:04:10,945 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:04:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-10 14:04:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-04-10 14:04:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 14:04:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-04-10 14:04:10,957 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 16 [2018-04-10 14:04:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:10,958 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-04-10 14:04:10,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:04:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-04-10 14:04:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 14:04:10,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:10,958 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:10,958 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:10,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1014420056, now seen corresponding path program 1 times [2018-04-10 14:04:10,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:10,959 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:10,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:10,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:10,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:11,035 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:04:11,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:11,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:04:11,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:04:11,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:04:11,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:04:11,036 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 5 states. [2018-04-10 14:04:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:11,221 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2018-04-10 14:04:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:04:11,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 14:04:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:11,223 INFO L225 Difference]: With dead ends: 239 [2018-04-10 14:04:11,223 INFO L226 Difference]: Without dead ends: 239 [2018-04-10 14:04:11,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:04:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-10 14:04:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 161. [2018-04-10 14:04:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 14:04:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2018-04-10 14:04:11,231 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 16 [2018-04-10 14:04:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:11,231 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2018-04-10 14:04:11,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:04:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2018-04-10 14:04:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:04:11,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:11,232 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:04:11,232 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash -99903366, now seen corresponding path program 1 times [2018-04-10 14:04:11,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:11,232 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:11,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:11,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:11,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:11,277 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:04:11,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:11,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:04:11,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:04:11,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:04:11,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:04:11,278 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand 5 states. [2018-04-10 14:04:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:11,444 INFO L93 Difference]: Finished difference Result 255 states and 276 transitions. [2018-04-10 14:04:11,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:04:11,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:04:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:11,445 INFO L225 Difference]: With dead ends: 255 [2018-04-10 14:04:11,445 INFO L226 Difference]: Without dead ends: 255 [2018-04-10 14:04:11,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:04:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-10 14:04:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 160. [2018-04-10 14:04:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-10 14:04:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2018-04-10 14:04:11,452 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 18 [2018-04-10 14:04:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:11,452 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2018-04-10 14:04:11,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:04:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2018-04-10 14:04:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:04:11,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:11,453 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:04:11,459 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash -99903365, now seen corresponding path program 1 times [2018-04-10 14:04:11,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:11,460 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:11,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:11,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:11,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:11,510 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:04:11,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:11,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:04:11,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:04:11,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:04:11,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:04:11,511 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand 5 states. [2018-04-10 14:04:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:11,703 INFO L93 Difference]: Finished difference Result 264 states and 285 transitions. [2018-04-10 14:04:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:04:11,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:04:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:11,705 INFO L225 Difference]: With dead ends: 264 [2018-04-10 14:04:11,705 INFO L226 Difference]: Without dead ends: 264 [2018-04-10 14:04:11,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:04:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-10 14:04:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 159. [2018-04-10 14:04:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-10 14:04:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-04-10 14:04:11,709 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 18 [2018-04-10 14:04:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:11,709 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-04-10 14:04:11,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:04:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-04-10 14:04:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:04:11,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:11,710 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:11,710 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1631135996, now seen corresponding path program 1 times [2018-04-10 14:04:11,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:11,711 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:11,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:11,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:11,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:11,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:11,805 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:04:11,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:11,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:04:11,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:04:11,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:04:11,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:04:11,806 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 9 states. [2018-04-10 14:04:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:12,051 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-04-10 14:04:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:04:12,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-10 14:04:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:12,052 INFO L225 Difference]: With dead ends: 163 [2018-04-10 14:04:12,052 INFO L226 Difference]: Without dead ends: 163 [2018-04-10 14:04:12,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:04:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-10 14:04:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-04-10 14:04:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 14:04:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-10 14:04:12,057 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 22 [2018-04-10 14:04:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:12,057 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-10 14:04:12,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:04:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-10 14:04:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:04:12,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:12,058 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:12,058 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1631135997, now seen corresponding path program 1 times [2018-04-10 14:04:12,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:12,059 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:12,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:12,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:12,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:12,183 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:04:12,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:12,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 14:04:12,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:04:12,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:04:12,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:04:12,184 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 10 states. [2018-04-10 14:04:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:12,757 INFO L93 Difference]: Finished difference Result 223 states and 237 transitions. [2018-04-10 14:04:12,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:04:12,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-10 14:04:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:12,758 INFO L225 Difference]: With dead ends: 223 [2018-04-10 14:04:12,758 INFO L226 Difference]: Without dead ends: 223 [2018-04-10 14:04:12,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:04:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-10 14:04:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 142. [2018-04-10 14:04:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-10 14:04:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2018-04-10 14:04:12,762 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 22 [2018-04-10 14:04:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:12,762 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2018-04-10 14:04:12,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:04:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2018-04-10 14:04:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:04:12,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:12,763 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:12,763 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash 382306449, now seen corresponding path program 1 times [2018-04-10 14:04:12,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:12,763 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:12,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:12,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:12,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:04:12,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:12,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:04:12,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:04:12,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:04:12,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:04:12,824 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 6 states. [2018-04-10 14:04:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:12,949 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-04-10 14:04:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:04:12,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-04-10 14:04:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:12,950 INFO L225 Difference]: With dead ends: 225 [2018-04-10 14:04:12,950 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 14:04:12,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:04:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 14:04:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2018-04-10 14:04:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-10 14:04:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-04-10 14:04:12,953 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 29 [2018-04-10 14:04:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:12,953 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-04-10 14:04:12,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:04:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-04-10 14:04:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:04:12,955 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:12,955 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:12,955 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash -568275933, now seen corresponding path program 1 times [2018-04-10 14:04:12,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:12,956 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:12,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:12,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:12,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:12,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:12,975 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:04:12,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:12,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:04:12,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:04:12,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:04:12,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:04:12,976 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 3 states. [2018-04-10 14:04:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:13,008 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-04-10 14:04:13,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:04:13,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-04-10 14:04:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:13,009 INFO L225 Difference]: With dead ends: 187 [2018-04-10 14:04:13,009 INFO L226 Difference]: Without dead ends: 187 [2018-04-10 14:04:13,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:04:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-10 14:04:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2018-04-10 14:04:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 14:04:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-04-10 14:04:13,013 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 29 [2018-04-10 14:04:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:13,013 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-04-10 14:04:13,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:04:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-04-10 14:04:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:04:13,014 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:13,014 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:13,014 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash -976944239, now seen corresponding path program 1 times [2018-04-10 14:04:13,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:13,015 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:13,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:13,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:13,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:13,041 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:04:13,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:13,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:04:13,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:04:13,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:04:13,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:04:13,042 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-04-10 14:04:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:13,073 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2018-04-10 14:04:13,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:04:13,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-10 14:04:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:13,074 INFO L225 Difference]: With dead ends: 166 [2018-04-10 14:04:13,074 INFO L226 Difference]: Without dead ends: 166 [2018-04-10 14:04:13,075 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:04:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-10 14:04:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-04-10 14:04:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 14:04:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2018-04-10 14:04:13,078 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 30 [2018-04-10 14:04:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:13,079 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2018-04-10 14:04:13,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:04:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2018-04-10 14:04:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 14:04:13,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:13,080 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:13,080 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1040476521, now seen corresponding path program 1 times [2018-04-10 14:04:13,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:13,080 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:13,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:13,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:13,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:04:13,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:04:13,151 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:04:13,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:13,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:04:13,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:04:13,252 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:04:13,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:13,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:04:13,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:04:13,257 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:04:13,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:13,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:04:13,260 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:04:13,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-10 14:04:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:04:13,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:04:13,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-04-10 14:04:13,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:04:13,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:04:13,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:04:13,288 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand 9 states. [2018-04-10 14:04:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:13,486 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-04-10 14:04:13,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:04:13,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-10 14:04:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:13,488 INFO L225 Difference]: With dead ends: 197 [2018-04-10 14:04:13,488 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 14:04:13,488 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:04:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 14:04:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2018-04-10 14:04:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-10 14:04:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2018-04-10 14:04:13,492 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 36 [2018-04-10 14:04:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:13,493 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2018-04-10 14:04:13,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:04:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2018-04-10 14:04:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:04:13,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:13,494 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:13,494 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2104967361, now seen corresponding path program 1 times [2018-04-10 14:04:13,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:13,494 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:13,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:13,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:13,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:04:13,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:04:13,548 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:04:13,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:13,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:04:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:04:13,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:04:13,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-04-10 14:04:13,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:04:13,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:04:13,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=63, Unknown=6, NotChecked=0, Total=90 [2018-04-10 14:04:13,678 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand 10 states. [2018-04-10 14:04:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:13,932 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2018-04-10 14:04:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:04:13,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-10 14:04:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:13,933 INFO L225 Difference]: With dead ends: 191 [2018-04-10 14:04:13,933 INFO L226 Difference]: Without dead ends: 168 [2018-04-10 14:04:13,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=127, Unknown=6, NotChecked=0, Total=182 [2018-04-10 14:04:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-10 14:04:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-10 14:04:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 14:04:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-04-10 14:04:13,938 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 37 [2018-04-10 14:04:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:13,938 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-04-10 14:04:13,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:04:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-04-10 14:04:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 14:04:13,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:13,940 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:13,940 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1821501930, now seen corresponding path program 1 times [2018-04-10 14:04:13,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:13,940 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:13,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:13,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:13,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:13,965 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:04:13,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:04:13,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:04:13,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:04:13,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:04:13,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:04:13,965 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 3 states. [2018-04-10 14:04:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:04:13,980 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2018-04-10 14:04:13,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:04:13,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-04-10 14:04:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:04:13,981 INFO L225 Difference]: With dead ends: 248 [2018-04-10 14:04:13,981 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 14:04:13,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:04:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 14:04:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 193. [2018-04-10 14:04:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 14:04:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2018-04-10 14:04:13,997 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 49 [2018-04-10 14:04:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:04:13,997 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2018-04-10 14:04:13,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:04:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2018-04-10 14:04:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 14:04:13,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:04:13,998 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:04:13,998 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:04:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash -114058552, now seen corresponding path program 1 times [2018-04-10 14:04:14,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:04:14,000 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:04:14,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:14,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:14,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:04:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:14,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:04:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:04:14,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:04:14,238 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:04:14,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:04:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:04:14,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:04:14,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:04:14,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:04:14,285 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:04:14,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:14,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:04:14,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:04:14,320 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:04:14,322 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:04:14,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:14,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:04:14,332 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:04:14,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:04:14,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:04:14,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-04-10 14:04:14,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:04:14,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:14,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:04:14,400 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:04:14,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-10 14:04:14,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-10 14:04:14,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:04:14,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:04:14,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:04:14,504 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:04:14,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-10 14:04:28,545 WARN L148 SmtUtils]: Spent 14022ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-10 14:04:28,593 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 43 treesize of output 31 [2018-04-10 14:04:28,596 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:04:28,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:28,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:04:28,604 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:28,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:04:28,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2018-04-10 14:04:28,635 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:04:28,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:04:28,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:04:28,646 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:04:28,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:04:28,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:04:28,665 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-10 14:04:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:04:28,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:04:28,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-04-10 14:04:28,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:04:28,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:04:28,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:04:28,768 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand 24 states. [2018-04-10 14:04:53,075 WARN L151 SmtUtils]: Spent 24058ms on a formula simplification. DAG size of input: 52 DAG size of output 45 [2018-04-10 14:05:17,131 WARN L151 SmtUtils]: Spent 24040ms on a formula simplification. DAG size of input: 46 DAG size of output 39 [2018-04-10 14:05:41,293 WARN L151 SmtUtils]: Spent 24045ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-10 14:06:09,355 WARN L151 SmtUtils]: Spent 28041ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-04-10 14:06:33,463 WARN L151 SmtUtils]: Spent 24039ms on a formula simplification. DAG size of input: 42 DAG size of output 38 [2018-04-10 14:06:47,671 WARN L148 SmtUtils]: Spent 14028ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-10 14:07:11,766 WARN L151 SmtUtils]: Spent 24047ms on a formula simplification. DAG size of input: 37 DAG size of output 37 [2018-04-10 14:07:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:07:12,032 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2018-04-10 14:07:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 14:07:12,033 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-04-10 14:07:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:07:12,034 INFO L225 Difference]: With dead ends: 278 [2018-04-10 14:07:12,034 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 14:07:12,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 176.9s TimeCoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:07:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 14:07:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 226. [2018-04-10 14:07:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-10 14:07:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2018-04-10 14:07:12,040 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 56 [2018-04-10 14:07:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:07:12,040 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2018-04-10 14:07:12,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:07:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2018-04-10 14:07:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 14:07:12,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:07:12,041 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:07:12,041 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:07:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash -114058551, now seen corresponding path program 1 times [2018-04-10 14:07:12,042 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:07:12,042 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:07:12,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:07:12,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:07:12,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:07:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:07:12,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:07:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:07:12,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:07:12,301 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:07:12,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:07:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:07:12,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:07:12,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:07:12,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:07:12,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:07:12,340 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:07:12,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:07:12,363 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:07:12,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:07:12,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,377 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:07:12,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:07:12,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,388 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:07:12,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:07:12,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:07:12,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 67 [2018-04-10 14:07:12,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:07:12,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:07:12,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:07:12,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,469 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:07:12,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-10 14:07:12,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 14:07:12,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:07:12,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:07:12,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:07:12,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-04-10 14:07:12,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-10 14:07:12,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:12,608 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 81 treesize of output 71 [2018-04-10 14:07:12,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:07:12,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:07:12,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:07:12,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:07:12,654 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-10 14:07:26,703 WARN L148 SmtUtils]: Spent 14023ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-10 14:07:26,749 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 65 treesize of output 55 [2018-04-10 14:07:26,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:07:26,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:07:26,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,790 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 87 treesize of output 65 [2018-04-10 14:07:26,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-04-10 14:07:26,793 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:07:26,814 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:07:26,823 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:07:26,848 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 43 treesize of output 35 [2018-04-10 14:07:26,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:07:26,853 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 14:07:26,861 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:07:26,861 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,867 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:07:26,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-04-10 14:07:26,870 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:07:26,870 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:07:26,878 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,883 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,902 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 41 treesize of output 29 [2018-04-10 14:07:26,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:07:26,903 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:07:26,908 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,910 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:07:26,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:07:26,924 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-10 14:07:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:07:26,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:07:26,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2018-04-10 14:07:26,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:07:26,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:07:26,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:07:26,987 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand 22 states. Received shutdown request... [2018-04-10 14:07:55,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:07:55,382 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:07:55,385 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:07:55,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:07:55 BoogieIcfgContainer [2018-04-10 14:07:55,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:07:55,386 INFO L168 Benchmark]: Toolchain (without parser) took 226127.60 ms. Allocated memory was 405.8 MB in the beginning and 701.5 MB in the end (delta: 295.7 MB). Free memory was 342.9 MB in the beginning and 614.2 MB in the end (delta: -271.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:07:55,386 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 405.8 MB. Free memory is still 369.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:07:55,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.40 ms. Allocated memory is still 405.8 MB. Free memory was 341.6 MB in the beginning and 313.8 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:07:55,387 INFO L168 Benchmark]: Boogie Preprocessor took 47.15 ms. Allocated memory is still 405.8 MB. Free memory was 313.8 MB in the beginning and 311.2 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:07:55,387 INFO L168 Benchmark]: RCFGBuilder took 568.18 ms. Allocated memory was 405.8 MB in the beginning and 615.5 MB in the end (delta: 209.7 MB). Free memory was 311.2 MB in the beginning and 526.3 MB in the end (delta: -215.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-10 14:07:55,387 INFO L168 Benchmark]: TraceAbstraction took 225235.15 ms. Allocated memory was 615.5 MB in the beginning and 701.5 MB in the end (delta: 86.0 MB). Free memory was 526.3 MB in the beginning and 614.2 MB in the end (delta: -88.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:07:55,388 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 405.8 MB. Free memory is still 369.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 274.40 ms. Allocated memory is still 405.8 MB. Free memory was 341.6 MB in the beginning and 313.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.15 ms. Allocated memory is still 405.8 MB. Free memory was 313.8 MB in the beginning and 311.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 568.18 ms. Allocated memory was 405.8 MB in the beginning and 615.5 MB in the end (delta: 209.7 MB). Free memory was 311.2 MB in the beginning and 526.3 MB in the end (delta: -215.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 225235.15 ms. Allocated memory was 615.5 MB in the beginning and 701.5 MB in the end (delta: 86.0 MB). Free memory was 526.3 MB in the beginning and 614.2 MB in the end (delta: -88.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 61 error locations. TIMEOUT Result, 225.1s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 194.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1935 SDtfs, 3483 SDslu, 4825 SDs, 0 SdLazy, 3710 SolverSat, 229 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 192.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 554 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 30.3s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 615 ConstructedInterpolants, 72 QuantifiedInterpolants, 501275 SizeOfPredicates, 35 NumberOfNonLiveVariables, 599 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 5/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-07-55-394.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-07-55-394.csv Completed graceful shutdown