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-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:00:36,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:00:36,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:00:36,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:00:36,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:00:36,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:00:36,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:00:36,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:00:36,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:00:36,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:00:36,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:00:36,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:00:36,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:00:36,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:00:36,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:00:36,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:00:36,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:00:36,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:00:36,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:00:36,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:00:36,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:00:36,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:00:36,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:00:36,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:00:36,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:00:36,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:00:36,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:00:36,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:00:36,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:00:36,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:00:36,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:00:36,534 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:00:36,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:00:36,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:00:36,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:00:36,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:00:36,547 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:00:36,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:00:36,548 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:00:36,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:00:36,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:00:36,548 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:00:36,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:00:36,548 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:00:36,548 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:00:36,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:00:36,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:00:36,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:00:36,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:00:36,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:00:36,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:00:36,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:00:36,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:00:36,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:00:36,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:00:36,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:00:36,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:00:36,590 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:00:36,593 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:00:36,594 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:00:36,595 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:00:36,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,952 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe693b12a8 [2018-04-10 14:00:37,071 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:00:37,071 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:00:37,071 INFO L168 CDTParser]: Scanning dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,080 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:00:37,080 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:00:37,080 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:00:37,080 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,080 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:00:37,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__ino_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__int32_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__gid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__size_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__off_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__register_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____int8_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__key_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__timer_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_int in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____time_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____timer_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__int8_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__uid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,083 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__fd_set in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__div_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____dev_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__mode_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__quad_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,084 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__int16_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____u_short in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__ulong in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____u_long in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,085 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__SLL in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____mode_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____ino_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_short in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,086 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__clock_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____off_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____int16_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_long in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_char in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,087 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____loff_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__int64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__ushort in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____clock_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____off64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____key_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____u_char in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____gid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____quad_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____pid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__uint in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__loff_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__id_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____int64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____id_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__dev_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__time_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____int32_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____u_int in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____uid_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_circular_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,132 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe693b12a8 [2018-04-10 14:00:37,136 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:00:37,137 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:00:37,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:00:37,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:00:37,143 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:00:37,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21493bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37, skipping insertion in model container [2018-04-10 14:00:37,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,157 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:00:37,185 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:00:37,325 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:00:37,361 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:00:37,368 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:00:37,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37 WrapperNode [2018-04-10 14:00:37,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:00:37,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:00:37,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:00:37,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:00:37,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:00:37,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:00:37,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:00:37,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:00:37,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (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:00:37,543 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:00:37,543 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:00:37,543 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:00:37,543 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:00:37,544 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:00:37,545 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:00:37,546 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:00:37,547 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:00:37,548 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:00:37,549 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:00:37,550 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:00:37,551 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:00:37,552 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:00:37,553 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:00:37,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:00:37,555 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:00:37,947 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:00:37,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:00:37 BoogieIcfgContainer [2018-04-10 14:00:37,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:00:37,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:00:37,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:00:37,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:00:37,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:00:37" (1/3) ... [2018-04-10 14:00:37,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e25848c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:00:37, skipping insertion in model container [2018-04-10 14:00:37,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (2/3) ... [2018-04-10 14:00:37,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e25848c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:00:37, skipping insertion in model container [2018-04-10 14:00:37,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:00:37" (3/3) ... [2018-04-10 14:00:37,952 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,958 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:00:37,966 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-10 14:00:38,000 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:00:38,001 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:00:38,001 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:00:38,001 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:00:38,001 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:00:38,001 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:00:38,001 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:00:38,002 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:00:38,002 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:00:38,003 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:00:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-04-10 14:00:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:00:38,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,021 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:38,021 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash -659694479, now seen corresponding path program 1 times [2018-04-10 14:00:38,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,026 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,140 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:00:38,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:00:38,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:00:38,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:00:38,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:00:38,154 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 4 states. [2018-04-10 14:00:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:38,275 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-04-10 14:00:38,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:00:38,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:00:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:38,285 INFO L225 Difference]: With dead ends: 131 [2018-04-10 14:00:38,285 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 14:00:38,287 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:00:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 14:00:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2018-04-10 14:00:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-10 14:00:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-04-10 14:00:38,318 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 8 [2018-04-10 14:00:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:38,319 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-04-10 14:00:38,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:00:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-04-10 14:00:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:00:38,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,319 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:38,319 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash -659694478, now seen corresponding path program 1 times [2018-04-10 14:00:38,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,320 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,376 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:00:38,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:00:38,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:00:38,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:00:38,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:00:38,378 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 4 states. [2018-04-10 14:00:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:38,461 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-04-10 14:00:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:00:38,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:00:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:38,463 INFO L225 Difference]: With dead ends: 117 [2018-04-10 14:00:38,463 INFO L226 Difference]: Without dead ends: 117 [2018-04-10 14:00:38,464 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:00:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-10 14:00:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2018-04-10 14:00:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-10 14:00:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-04-10 14:00:38,471 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 8 [2018-04-10 14:00:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:38,471 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-04-10 14:00:38,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:00:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-04-10 14:00:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:00:38,471 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,472 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:38,472 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash -203321156, now seen corresponding path program 1 times [2018-04-10 14:00:38,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,472 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,514 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:00:38,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:00:38,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:00:38,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:00:38,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:00:38,515 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 4 states. [2018-04-10 14:00:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:38,629 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-04-10 14:00:38,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:00:38,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 14:00:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:38,630 INFO L225 Difference]: With dead ends: 101 [2018-04-10 14:00:38,630 INFO L226 Difference]: Without dead ends: 101 [2018-04-10 14:00:38,630 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:00:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-10 14:00:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2018-04-10 14:00:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-10 14:00:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-04-10 14:00:38,633 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 15 [2018-04-10 14:00:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:38,633 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-04-10 14:00:38,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:00:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-04-10 14:00:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:00:38,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,634 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:38,634 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash -203321155, now seen corresponding path program 1 times [2018-04-10 14:00:38,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,634 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,698 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:00:38,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:38,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:38,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:38,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:38,699 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 5 states. [2018-04-10 14:00:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:38,847 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-04-10 14:00:38,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:00:38,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-10 14:00:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:38,851 INFO L225 Difference]: With dead ends: 119 [2018-04-10 14:00:38,852 INFO L226 Difference]: Without dead ends: 119 [2018-04-10 14:00:38,852 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:00:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-10 14:00:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2018-04-10 14:00:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-10 14:00:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-04-10 14:00:38,857 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 15 [2018-04-10 14:00:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:38,858 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-04-10 14:00:38,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-04-10 14:00:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:00:38,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,858 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:00:38,859 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1236615327, now seen corresponding path program 1 times [2018-04-10 14:00:38,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,859 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,904 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:00:38,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:38,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:38,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:38,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:38,905 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 5 states. [2018-04-10 14:00:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:39,049 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-04-10 14:00:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:00:39,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:00:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:39,050 INFO L225 Difference]: With dead ends: 150 [2018-04-10 14:00:39,050 INFO L226 Difference]: Without dead ends: 150 [2018-04-10 14:00:39,050 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:00:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-10 14:00:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 101. [2018-04-10 14:00:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-10 14:00:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-04-10 14:00:39,053 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 18 [2018-04-10 14:00:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:39,054 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-04-10 14:00:39,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-04-10 14:00:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:00:39,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:39,054 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:00:39,054 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1236615326, now seen corresponding path program 1 times [2018-04-10 14:00:39,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:39,054 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:39,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:39,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:39,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:39,112 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:00:39,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:39,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:39,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:39,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:39,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:39,113 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2018-04-10 14:00:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:39,267 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-04-10 14:00:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:39,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:00:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:39,269 INFO L225 Difference]: With dead ends: 152 [2018-04-10 14:00:39,269 INFO L226 Difference]: Without dead ends: 152 [2018-04-10 14:00:39,269 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:00:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-10 14:00:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-04-10 14:00:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-10 14:00:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-04-10 14:00:39,274 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 18 [2018-04-10 14:00:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:39,274 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-04-10 14:00:39,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-04-10 14:00:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:00:39,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:39,275 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:00:39,275 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2005882920, now seen corresponding path program 1 times [2018-04-10 14:00:39,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:39,275 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:39,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:39,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:39,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:39,339 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:00:39,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:39,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:00:39,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:00:39,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:00:39,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:00:39,340 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 6 states. [2018-04-10 14:00:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:39,475 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-04-10 14:00:39,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:39,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-10 14:00:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:39,477 INFO L225 Difference]: With dead ends: 145 [2018-04-10 14:00:39,477 INFO L226 Difference]: Without dead ends: 145 [2018-04-10 14:00:39,477 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:00:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-10 14:00:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 107. [2018-04-10 14:00:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-10 14:00:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-04-10 14:00:39,481 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 22 [2018-04-10 14:00:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:39,482 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-04-10 14:00:39,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:00:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-04-10 14:00:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:00:39,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:39,483 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:00:39,483 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:39,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2005882921, now seen corresponding path program 1 times [2018-04-10 14:00:39,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:39,483 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:39,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:39,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:39,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:39,572 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:00:39,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:39,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:00:39,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:00:39,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:00:39,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:39,573 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 7 states. [2018-04-10 14:00:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:39,742 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2018-04-10 14:00:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:00:39,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-10 14:00:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:39,743 INFO L225 Difference]: With dead ends: 180 [2018-04-10 14:00:39,744 INFO L226 Difference]: Without dead ends: 180 [2018-04-10 14:00:39,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:00:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-10 14:00:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 120. [2018-04-10 14:00:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-10 14:00:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2018-04-10 14:00:39,747 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 22 [2018-04-10 14:00:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:39,747 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2018-04-10 14:00:39,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:00:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2018-04-10 14:00:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:00:39,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:39,748 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:00:39,748 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash 170689635, now seen corresponding path program 1 times [2018-04-10 14:00:39,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:39,748 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:39,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:39,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:39,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:39,822 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:00:39,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:39,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:00:39,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:00:39,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:00:39,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:00:39,824 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 9 states. [2018-04-10 14:00:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:40,045 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-04-10 14:00:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:00:40,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-10 14:00:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:40,046 INFO L225 Difference]: With dead ends: 128 [2018-04-10 14:00:40,046 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 14:00:40,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:00:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 14:00:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2018-04-10 14:00:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-10 14:00:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2018-04-10 14:00:40,050 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 22 [2018-04-10 14:00:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:40,051 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-04-10 14:00:40,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:00:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-04-10 14:00:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:00:40,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:40,051 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:00:40,051 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash 170689636, now seen corresponding path program 1 times [2018-04-10 14:00:40,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:40,052 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:40,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:40,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:40,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:40,149 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:00:40,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:40,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 14:00:40,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:00:40,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:00:40,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:00:40,150 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand 10 states. [2018-04-10 14:00:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:40,477 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-04-10 14:00:40,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:00:40,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-10 14:00:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:40,477 INFO L225 Difference]: With dead ends: 123 [2018-04-10 14:00:40,477 INFO L226 Difference]: Without dead ends: 123 [2018-04-10 14:00:40,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 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:00:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-10 14:00:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-04-10 14:00:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-10 14:00:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-04-10 14:00:40,480 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 22 [2018-04-10 14:00:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:40,480 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-04-10 14:00:40,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:00:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-04-10 14:00:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:00:40,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:40,481 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:40,481 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash -226372977, now seen corresponding path program 1 times [2018-04-10 14:00:40,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:40,481 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:40,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:40,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:40,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:40,546 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:00:40,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:40,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:00:40,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:00:40,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:00:40,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:00:40,547 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 6 states. [2018-04-10 14:00:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:40,716 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-04-10 14:00:40,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:00:40,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-10 14:00:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:40,717 INFO L225 Difference]: With dead ends: 152 [2018-04-10 14:00:40,717 INFO L226 Difference]: Without dead ends: 152 [2018-04-10 14:00:40,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:00:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-10 14:00:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 107. [2018-04-10 14:00:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-10 14:00:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-04-10 14:00:40,719 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 26 [2018-04-10 14:00:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:40,719 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-04-10 14:00:40,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:00:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-04-10 14:00:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:00:40,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:40,720 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:40,720 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash -226372976, now seen corresponding path program 1 times [2018-04-10 14:00:40,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:40,721 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:40,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:40,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:40,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:40,793 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:00:40,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:40,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:40,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:40,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:40,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:40,794 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 8 states. [2018-04-10 14:00:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,017 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-04-10 14:00:41,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:00:41,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-04-10 14:00:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,018 INFO L225 Difference]: With dead ends: 166 [2018-04-10 14:00:41,018 INFO L226 Difference]: Without dead ends: 166 [2018-04-10 14:00:41,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:00:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-10 14:00:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 107. [2018-04-10 14:00:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-10 14:00:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-04-10 14:00:41,020 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 26 [2018-04-10 14:00:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,020 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-04-10 14:00:41,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-04-10 14:00:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 14:00:41,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,021 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:41,021 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1571912662, now seen corresponding path program 1 times [2018-04-10 14:00:41,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,021 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:41,048 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:00:41,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:41,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:00:41,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:00:41,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:00:41,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:41,049 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 7 states. [2018-04-10 14:00:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,279 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-04-10 14:00:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:00:41,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-10 14:00:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,281 INFO L225 Difference]: With dead ends: 145 [2018-04-10 14:00:41,281 INFO L226 Difference]: Without dead ends: 145 [2018-04-10 14:00:41,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:00:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-10 14:00:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2018-04-10 14:00:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-10 14:00:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2018-04-10 14:00:41,284 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 27 [2018-04-10 14:00:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,284 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2018-04-10 14:00:41,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:00:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2018-04-10 14:00:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 14:00:41,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,285 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:41,285 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1571912663, now seen corresponding path program 1 times [2018-04-10 14:00:41,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,286 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:41,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:41,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:00:41,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:00:41,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:00:41,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:00:41,436 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 9 states. [2018-04-10 14:00:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,721 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2018-04-10 14:00:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:00:41,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-04-10 14:00:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,722 INFO L225 Difference]: With dead ends: 175 [2018-04-10 14:00:41,722 INFO L226 Difference]: Without dead ends: 175 [2018-04-10 14:00:41,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:00:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-10 14:00:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 134. [2018-04-10 14:00:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:00:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2018-04-10 14:00:41,725 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 27 [2018-04-10 14:00:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,725 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2018-04-10 14:00:41,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:00:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2018-04-10 14:00:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:00:41,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,725 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:41,726 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash -911862981, now seen corresponding path program 1 times [2018-04-10 14:00:41,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,726 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:41,782 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:00:41,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:41,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:00:41,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:00:41,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:00:41,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:00:41,783 INFO L87 Difference]: Start difference. First operand 134 states and 159 transitions. Second operand 6 states. [2018-04-10 14:00:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,891 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-04-10 14:00:41,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:00:41,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 14:00:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,892 INFO L225 Difference]: With dead ends: 155 [2018-04-10 14:00:41,892 INFO L226 Difference]: Without dead ends: 155 [2018-04-10 14:00:41,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:00:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-10 14:00:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-04-10 14:00:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:00:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-04-10 14:00:41,895 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 31 [2018-04-10 14:00:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,896 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-04-10 14:00:41,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:00:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-04-10 14:00:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:00:41,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,896 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:41,897 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash -911862980, now seen corresponding path program 1 times [2018-04-10 14:00:41,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,897 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:42,006 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:00:42,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:42,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:42,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:42,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:42,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:42,007 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 8 states. [2018-04-10 14:00:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:42,219 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-04-10 14:00:42,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:00:42,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-10 14:00:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:42,219 INFO L225 Difference]: With dead ends: 164 [2018-04-10 14:00:42,219 INFO L226 Difference]: Without dead ends: 164 [2018-04-10 14:00:42,220 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:00:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-10 14:00:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. [2018-04-10 14:00:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:00:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2018-04-10 14:00:42,221 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 31 [2018-04-10 14:00:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:42,222 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2018-04-10 14:00:42,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2018-04-10 14:00:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 14:00:42,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:42,222 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:42,222 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2085977512, now seen corresponding path program 1 times [2018-04-10 14:00:42,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:42,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:42,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:42,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:42,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:42,315 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:00:42,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:42,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:42,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:42,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:42,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:42,316 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand 8 states. [2018-04-10 14:00:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:42,579 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-04-10 14:00:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:00:42,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-10 14:00:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:42,580 INFO L225 Difference]: With dead ends: 167 [2018-04-10 14:00:42,580 INFO L226 Difference]: Without dead ends: 162 [2018-04-10 14:00:42,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:00:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-10 14:00:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 133. [2018-04-10 14:00:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 14:00:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2018-04-10 14:00:42,584 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 33 [2018-04-10 14:00:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:42,584 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2018-04-10 14:00:42,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2018-04-10 14:00:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 14:00:42,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:42,585 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] [2018-04-10 14:00:42,585 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -972014181, now seen corresponding path program 1 times [2018-04-10 14:00:42,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:42,585 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:42,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:42,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:42,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:42,654 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:00:42,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:42,654 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:00:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:42,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:42,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:00:42,768 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 13 treesize of output 5 [2018-04-10 14:00:42,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:42,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:42,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:42,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:00:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:42,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:00:42,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-04-10 14:00:42,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:42,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:42,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:42,817 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 8 states. [2018-04-10 14:00:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:43,072 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-04-10 14:00:43,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:00:43,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-10 14:00:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:43,073 INFO L225 Difference]: With dead ends: 149 [2018-04-10 14:00:43,073 INFO L226 Difference]: Without dead ends: 149 [2018-04-10 14:00:43,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:00:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-10 14:00:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2018-04-10 14:00:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-10 14:00:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-04-10 14:00:43,077 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 34 [2018-04-10 14:00:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:43,077 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-04-10 14:00:43,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-04-10 14:00:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 14:00:43,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:43,078 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] [2018-04-10 14:00:43,078 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:43,078 INFO L82 PathProgramCache]: Analyzing trace with hash -972014180, now seen corresponding path program 1 times [2018-04-10 14:00:43,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:43,078 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:43,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:43,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:43,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:43,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:43,173 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:00:43,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:43,174 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:00:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:43,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:43,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:00:43,233 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 19 treesize of output 11 [2018-04-10 14:00:43,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,243 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 28 treesize of output 22 [2018-04-10 14:00:43,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 14:00:43,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,261 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:00:43,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:00:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:43,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:00:43,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-04-10 14:00:43,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:00:43,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:00:43,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:00:43,298 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 13 states. [2018-04-10 14:00:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:44,018 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2018-04-10 14:00:44,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:00:44,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-04-10 14:00:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:44,019 INFO L225 Difference]: With dead ends: 183 [2018-04-10 14:00:44,019 INFO L226 Difference]: Without dead ends: 183 [2018-04-10 14:00:44,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=1158, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 14:00:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-10 14:00:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 150. [2018-04-10 14:00:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 14:00:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-04-10 14:00:44,021 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 34 [2018-04-10 14:00:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:44,022 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-04-10 14:00:44,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:00:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-04-10 14:00:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 14:00:44,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:44,022 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:44,022 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2027077560, now seen corresponding path program 1 times [2018-04-10 14:00:44,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:44,023 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:44,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:44,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:44,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:44,056 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:00:44,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:44,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:00:44,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:00:44,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:00:44,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:00:44,057 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 3 states. [2018-04-10 14:00:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:44,067 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2018-04-10 14:00:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:00:44,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-04-10 14:00:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:44,069 INFO L225 Difference]: With dead ends: 224 [2018-04-10 14:00:44,070 INFO L226 Difference]: Without dead ends: 224 [2018-04-10 14:00:44,070 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:00:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-10 14:00:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 168. [2018-04-10 14:00:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 14:00:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2018-04-10 14:00:44,074 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 34 [2018-04-10 14:00:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:44,074 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2018-04-10 14:00:44,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:00:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2018-04-10 14:00:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:00:44,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:44,075 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] [2018-04-10 14:00:44,075 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -941342148, now seen corresponding path program 1 times [2018-04-10 14:00:44,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:44,075 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:44,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:44,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:44,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:44,277 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:00:44,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:44,277 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:00:44,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:44,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:44,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:44,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:44,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-10 14:00:44,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:00:44,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:44,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:44,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-10 14:00:44,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:00:44,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:00:44,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-10 14:00:44,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-10 14:00:44,460 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 19 treesize of output 16 [2018-04-10 14:00:44,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:44,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:44,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:44,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:62 [2018-04-10 14:00:44,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 14:00:44,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:44,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 14:00:44,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 14:00:44,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:00:44,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:44,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:44,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:9 [2018-04-10 14:00:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:44,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:00:44,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2018-04-10 14:00:44,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:00:44,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:00:44,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:00:44,604 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand 24 states. [2018-04-10 14:00:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:45,151 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2018-04-10 14:00:45,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:00:45,151 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-04-10 14:00:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:45,152 INFO L225 Difference]: With dead ends: 177 [2018-04-10 14:00:45,152 INFO L226 Difference]: Without dead ends: 177 [2018-04-10 14:00:45,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:00:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-10 14:00:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2018-04-10 14:00:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 14:00:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 194 transitions. [2018-04-10 14:00:45,155 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 194 transitions. Word has length 35 [2018-04-10 14:00:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:45,155 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 194 transitions. [2018-04-10 14:00:45,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:00:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 194 transitions. [2018-04-10 14:00:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-10 14:00:45,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:45,156 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:45,156 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:45,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1570978174, now seen corresponding path program 1 times [2018-04-10 14:00:45,156 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:45,157 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:45,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:45,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:45,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:45,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:45,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:45,224 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:00:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:45,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:45,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:45,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:45,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:45,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:45,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-10 14:00:45,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:00:45,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:45,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:45,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:00:45,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:45,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:45,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-10 14:00:45,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-04-10 14:00:45,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:45,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-10 14:00:45,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:45,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:33 [2018-04-10 14:00:45,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:00:45,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2018-04-10 14:00:45,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:45,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 14:00:45,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:45,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:5 [2018-04-10 14:00:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:45,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:45,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-04-10 14:00:45,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:00:45,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:00:45,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=120, Unknown=6, NotChecked=0, Total=156 [2018-04-10 14:00:45,508 INFO L87 Difference]: Start difference. First operand 168 states and 194 transitions. Second operand 13 states. [2018-04-10 14:00:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:45,837 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2018-04-10 14:00:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:00:45,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-04-10 14:00:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:45,840 INFO L225 Difference]: With dead ends: 183 [2018-04-10 14:00:45,840 INFO L226 Difference]: Without dead ends: 183 [2018-04-10 14:00:45,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=278, Unknown=6, NotChecked=0, Total=380 [2018-04-10 14:00:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-10 14:00:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-04-10 14:00:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 14:00:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2018-04-10 14:00:45,843 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 38 [2018-04-10 14:00:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:45,843 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2018-04-10 14:00:45,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:00:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2018-04-10 14:00:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-10 14:00:45,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:45,844 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:45,844 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1570978173, now seen corresponding path program 1 times [2018-04-10 14:00:45,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:45,845 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:45,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:45,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:45,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:45,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:45,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:45,960 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:45,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:45,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:46,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:46,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:46,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:46,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:46,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-10 14:00:46,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:00:46,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:46,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:46,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:00:46,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:46,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:46,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 14:00:46,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-04-10 14:00:46,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-10 14:00:46,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-10 14:00:46,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-10 14:00:46,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:46,292 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:00:46,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:9 [2018-04-10 14:00:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 14:00:46,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:46,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-04-10 14:00:46,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:00:46,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:00:46,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=292, Unknown=3, NotChecked=0, Total=342 [2018-04-10 14:00:46,348 INFO L87 Difference]: Start difference. First operand 168 states and 193 transitions. Second operand 19 states. [2018-04-10 14:00:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:46,987 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2018-04-10 14:00:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:00:46,987 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-04-10 14:00:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:46,988 INFO L225 Difference]: With dead ends: 182 [2018-04-10 14:00:46,988 INFO L226 Difference]: Without dead ends: 182 [2018-04-10 14:00:46,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=580, Unknown=4, NotChecked=0, Total=756 [2018-04-10 14:00:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-10 14:00:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 159. [2018-04-10 14:00:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-10 14:00:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2018-04-10 14:00:46,991 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 38 [2018-04-10 14:00:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:46,991 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2018-04-10 14:00:46,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:00:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2018-04-10 14:00:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 14:00:46,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:46,992 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] [2018-04-10 14:00:46,992 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 150327430, now seen corresponding path program 1 times [2018-04-10 14:00:46,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:46,992 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:46,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:46,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:47,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:47,131 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:00:47,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:47,131 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:47,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:47,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:47,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:47,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:47,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:00:47,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:00:47,204 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:00:47,206 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:00:47,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,217 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:00:47,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:00:47,267 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 39 treesize of output 35 [2018-04-10 14:00:47,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:47,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,281 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:00:47,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-10 14:00:47,351 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:00:47,353 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 25 [2018-04-10 14:00:47,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:47,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-04-10 14:00:49,391 WARN L151 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 25 DAG size of output 21 [2018-04-10 14:00:49,404 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 38 treesize of output 26 [2018-04-10 14:00:49,405 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:00:49,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:49,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:00:49,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:49,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:49,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:49,414 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 14:00:49,443 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:00:49,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:49,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-04-10 14:00:49,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:00:49,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:00:49,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:00:49,463 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand 21 states. [2018-04-10 14:00:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:50,096 INFO L93 Difference]: Finished difference Result 318 states and 350 transitions. [2018-04-10 14:00:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:00:50,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-04-10 14:00:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:50,098 INFO L225 Difference]: With dead ends: 318 [2018-04-10 14:00:50,098 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 14:00:50,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:00:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 14:00:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 229. [2018-04-10 14:00:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 14:00:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 256 transitions. [2018-04-10 14:00:50,103 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 256 transitions. Word has length 39 [2018-04-10 14:00:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:50,104 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 256 transitions. [2018-04-10 14:00:50,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:00:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 256 transitions. [2018-04-10 14:00:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 14:00:50,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:50,105 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] [2018-04-10 14:00:50,105 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash 150327431, now seen corresponding path program 1 times [2018-04-10 14:00:50,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:50,105 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:50,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:50,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:50,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:50,252 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:00:50,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:50,252 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:50,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:50,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:50,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:00:50,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:50,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:50,284 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:00:50,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:00:50,294 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:00:50,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:00:50,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,304 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:00:50,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:00:50,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,311 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:00:50,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:00:50,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 14:00:50,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:00:50,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:00:50,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:00:50,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,374 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:00:50,374 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-10 14:00:50,432 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 82 treesize of output 72 [2018-04-10 14:00:50,435 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 25 [2018-04-10 14:00:50,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 14:00:50,455 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 25 [2018-04-10 14:00:50,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:50,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:50,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-04-10 14:00:52,521 WARN L151 SmtUtils]: Spent 2029ms on a formula simplification. DAG size of input: 35 DAG size of output 28 [2018-04-10 14:00:52,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-10 14:00:52,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-10 14:00:52,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:52,540 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:00:52,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:52,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:52,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 14:00:52,560 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:00:52,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:52,564 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:00:52,564 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:52,565 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:52,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:52,569 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-10 14:00:52,580 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:00:52,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:52,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-04-10 14:00:52,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:00:52,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:00:52,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:00:52,599 INFO L87 Difference]: Start difference. First operand 229 states and 256 transitions. Second operand 18 states. [2018-04-10 14:00:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:53,101 INFO L93 Difference]: Finished difference Result 299 states and 330 transitions. [2018-04-10 14:00:53,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:00:53,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-04-10 14:00:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:53,103 INFO L225 Difference]: With dead ends: 299 [2018-04-10 14:00:53,103 INFO L226 Difference]: Without dead ends: 299 [2018-04-10 14:00:53,103 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-04-10 14:00:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-10 14:00:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2018-04-10 14:00:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-10 14:00:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2018-04-10 14:00:53,105 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 39 [2018-04-10 14:00:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:53,105 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2018-04-10 14:00:53,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:00:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2018-04-10 14:00:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:00:53,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:53,106 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:53,106 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 978624296, now seen corresponding path program 1 times [2018-04-10 14:00:53,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:53,106 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:53,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:53,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:53,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:53,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 14:00:53,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:53,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:53,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:53,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:53,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:53,144 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand 5 states. [2018-04-10 14:00:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:53,235 INFO L93 Difference]: Finished difference Result 253 states and 284 transitions. [2018-04-10 14:00:53,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:53,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 14:00:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:53,237 INFO L225 Difference]: With dead ends: 253 [2018-04-10 14:00:53,237 INFO L226 Difference]: Without dead ends: 253 [2018-04-10 14:00:53,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-10 14:00:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2018-04-10 14:00:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-10 14:00:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2018-04-10 14:00:53,241 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 43 [2018-04-10 14:00:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:53,241 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2018-04-10 14:00:53,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2018-04-10 14:00:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:00:53,242 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:53,242 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:53,242 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash 978624297, now seen corresponding path program 1 times [2018-04-10 14:00:53,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:53,242 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:53,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:53,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:53,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:53,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:53,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:53,395 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:53,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:53,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:53,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:00:53,444 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 19 treesize of output 11 [2018-04-10 14:00:53,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,450 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 28 treesize of output 22 [2018-04-10 14:00:53,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 14:00:53,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,456 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:00:53,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:00:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 14:00:53,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:00:53,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-04-10 14:00:53,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:00:53,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:00:53,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:00:53,492 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand 14 states. [2018-04-10 14:00:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:54,098 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2018-04-10 14:00:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:00:54,098 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-04-10 14:00:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:54,099 INFO L225 Difference]: With dead ends: 275 [2018-04-10 14:00:54,099 INFO L226 Difference]: Without dead ends: 275 [2018-04-10 14:00:54,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 14:00:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-10 14:00:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 248. [2018-04-10 14:00:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 14:00:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 277 transitions. [2018-04-10 14:00:54,102 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 277 transitions. Word has length 43 [2018-04-10 14:00:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:54,103 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 277 transitions. [2018-04-10 14:00:54,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:00:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 277 transitions. [2018-04-10 14:00:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:00:54,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:54,103 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:54,103 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 18410477, now seen corresponding path program 1 times [2018-04-10 14:00:54,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:54,104 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:54,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:54,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:54,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:54,238 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:00:54,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:54,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:54,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:54,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:54,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:54,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:54,264 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:00:54,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:00:54,272 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:00:54,273 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:00:54,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,280 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:00:54,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:54,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,287 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:00:54,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2018-04-10 14:00:54,305 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 51 treesize of output 47 [2018-04-10 14:00:54,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:00:54,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-10 14:00:54,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:00:54,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,325 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:00:54,325 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2018-04-10 14:00:54,380 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:00:54,383 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 24 treesize of output 29 [2018-04-10 14:00:54,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,399 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 52 treesize of output 47 [2018-04-10 14:00:54,401 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 24 treesize of output 29 [2018-04-10 14:00:54,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,417 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:00:54,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-04-10 14:00:56,439 WARN L148 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-10 14:00:56,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-04-10 14:00:56,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-10 14:00:56,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-10 14:00:56,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:56,490 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:45 [2018-04-10 14:00:56,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-04-10 14:00:56,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-04-10 14:00:56,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,539 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 14:00:56,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:5 [2018-04-10 14:00:56,548 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:00:56,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:56,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2018-04-10 14:00:56,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:00:56,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:00:56,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:00:56,568 INFO L87 Difference]: Start difference. First operand 248 states and 277 transitions. Second operand 20 states. [2018-04-10 14:01:12,811 WARN L151 SmtUtils]: Spent 4019ms on a formula simplification. DAG size of input: 38 DAG size of output 38 [2018-04-10 14:01:16,901 WARN L151 SmtUtils]: Spent 4025ms on a formula simplification. DAG size of input: 45 DAG size of output 45 [2018-04-10 14:01:18,950 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-10 14:01:21,069 WARN L148 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-10 14:01:23,097 WARN L148 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-10 14:01:25,252 WARN L148 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-10 14:01:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:25,285 INFO L93 Difference]: Finished difference Result 292 states and 321 transitions. [2018-04-10 14:01:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:01:25,285 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-04-10 14:01:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:25,286 INFO L225 Difference]: With dead ends: 292 [2018-04-10 14:01:25,286 INFO L226 Difference]: Without dead ends: 292 [2018-04-10 14:01:25,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=203, Invalid=1126, Unknown=3, NotChecked=0, Total=1332 [2018-04-10 14:01:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-10 14:01:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 248. [2018-04-10 14:01:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 14:01:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 276 transitions. [2018-04-10 14:01:25,289 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 276 transitions. Word has length 43 [2018-04-10 14:01:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:25,289 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 276 transitions. [2018-04-10 14:01:25,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:01:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 276 transitions. [2018-04-10 14:01:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:01:25,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:25,290 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:25,290 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash 18410478, now seen corresponding path program 1 times [2018-04-10 14:01:25,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:25,290 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:25,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:25,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:25,291 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:25,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:25,517 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:01:25,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:25,518 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:25,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:25,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:25,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:25,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-10 14:01:25,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:25,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:25,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:01:25,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-04-10 14:01:25,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:01:25,624 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:01:25,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:01:25,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:01:25,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,658 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:01:25,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-10 14:01:25,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 14:01:25,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:01:25,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-10 14:01:25,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:01:25,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,741 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:01:25,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-10 14:01:25,879 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 60 treesize of output 55 [2018-04-10 14:01:25,883 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 24 treesize of output 29 [2018-04-10 14:01:25,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,914 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 82 treesize of output 72 [2018-04-10 14:01:25,918 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 24 treesize of output 29 [2018-04-10 14:01:25,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:25,934 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:01:25,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:86 [2018-04-10 14:01:27,983 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-10 14:01:28,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2018-04-10 14:01:28,068 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-04-10 14:01:28,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:28,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 3 [2018-04-10 14:01:28,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:28,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:28,099 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 32 treesize of output 26 [2018-04-10 14:01:28,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-04-10 14:01:28,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:28,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:28,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:28,109 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:22 [2018-04-10 14:01:28,143 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:01:28,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:01:28,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-04-10 14:01:28,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:01:28,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:01:28,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:01:28,162 INFO L87 Difference]: Start difference. First operand 248 states and 276 transitions. Second operand 28 states. [2018-04-10 14:01:32,706 WARN L151 SmtUtils]: Spent 4034ms on a formula simplification. DAG size of input: 67 DAG size of output 49 [2018-04-10 14:01:36,122 WARN L151 SmtUtils]: Spent 3279ms on a formula simplification. DAG size of input: 80 DAG size of output 69 [2018-04-10 14:01:40,236 WARN L151 SmtUtils]: Spent 4046ms on a formula simplification. DAG size of input: 64 DAG size of output 61 [2018-04-10 14:01:44,442 WARN L151 SmtUtils]: Spent 4026ms on a formula simplification. DAG size of input: 51 DAG size of output 43 [2018-04-10 14:01:48,549 WARN L151 SmtUtils]: Spent 4075ms on a formula simplification. DAG size of input: 80 DAG size of output 66 [2018-04-10 14:01:52,760 WARN L151 SmtUtils]: Spent 4024ms on a formula simplification. DAG size of input: 47 DAG size of output 39 [2018-04-10 14:01:56,904 WARN L151 SmtUtils]: Spent 4033ms on a formula simplification. DAG size of input: 65 DAG size of output 51 [2018-04-10 14:01:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:56,970 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2018-04-10 14:01:56,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 14:01:56,971 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 43 [2018-04-10 14:01:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:56,972 INFO L225 Difference]: With dead ends: 294 [2018-04-10 14:01:56,972 INFO L226 Difference]: Without dead ends: 294 [2018-04-10 14:01:56,972 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=372, Invalid=1884, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:01:56,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-10 14:01:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 248. [2018-04-10 14:01:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 14:01:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 275 transitions. [2018-04-10 14:01:56,975 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 275 transitions. Word has length 43 [2018-04-10 14:01:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:56,975 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 275 transitions. [2018-04-10 14:01:56,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:01:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 275 transitions. [2018-04-10 14:01:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 14:01:56,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:56,975 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:56,976 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash 570265145, now seen corresponding path program 1 times [2018-04-10 14:01:56,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:56,976 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:56,976 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:56,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:56,976 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:56,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:57,177 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:01:57,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:57,177 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:57,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:57,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:57,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:01:57,266 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 19 treesize of output 11 [2018-04-10 14:01:57,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:57,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:57,272 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 28 treesize of output 22 [2018-04-10 14:01:57,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 14:01:57,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:57,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:57,278 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:01:57,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:01:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:01:57,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:01:57,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 19 [2018-04-10 14:01:57,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:01:57,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:01:57,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:01:57,328 INFO L87 Difference]: Start difference. First operand 248 states and 275 transitions. Second operand 20 states. [2018-04-10 14:01:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:58,067 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2018-04-10 14:01:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 14:01:58,067 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-10 14:01:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:58,068 INFO L225 Difference]: With dead ends: 320 [2018-04-10 14:01:58,068 INFO L226 Difference]: Without dead ends: 320 [2018-04-10 14:01:58,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=2179, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 14:01:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-10 14:01:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 244. [2018-04-10 14:01:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-10 14:01:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 271 transitions. [2018-04-10 14:01:58,071 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 271 transitions. Word has length 44 [2018-04-10 14:01:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:58,072 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 271 transitions. [2018-04-10 14:01:58,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:01:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 271 transitions. [2018-04-10 14:01:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:01:58,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:58,072 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:58,073 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1731005562, now seen corresponding path program 1 times [2018-04-10 14:01:58,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:58,073 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:58,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:58,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:58,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:58,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:58,340 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:01:58,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:58,340 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:58,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:58,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:58,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:58,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:58,405 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:01:58,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:01:58,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:01:58,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:01:58,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:01:58,443 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:01:58,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,449 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:01:58,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-10 14:01:58,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 14:01:58,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:01:58,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-04-10 14:01:58,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 14:01:58,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:01:58,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:58,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2018-04-10 14:01:58,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-04-10 14:01:58,564 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 34 treesize of output 35 [2018-04-10 14:01:58,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 14:01:58,603 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:58,620 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2018-04-10 14:01:58,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 14:01:58,674 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:01:58,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,677 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:01:58,678 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:58,680 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-10 14:01:58,702 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:01:58,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:01:58,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-04-10 14:01:58,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:01:58,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:01:58,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:01:58,719 INFO L87 Difference]: Start difference. First operand 244 states and 271 transitions. Second operand 26 states. [2018-04-10 14:01:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:59,618 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2018-04-10 14:01:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:01:59,618 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-04-10 14:01:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:59,619 INFO L225 Difference]: With dead ends: 294 [2018-04-10 14:01:59,619 INFO L226 Difference]: Without dead ends: 294 [2018-04-10 14:01:59,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=412, Invalid=1750, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:01:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-10 14:01:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 266. [2018-04-10 14:01:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 14:01:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 299 transitions. [2018-04-10 14:01:59,622 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 299 transitions. Word has length 46 [2018-04-10 14:01:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:59,622 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 299 transitions. [2018-04-10 14:01:59,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:01:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 299 transitions. [2018-04-10 14:01:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:01:59,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:59,623 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:59,623 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash -446623831, now seen corresponding path program 1 times [2018-04-10 14:01:59,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:59,623 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:59,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:59,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:59,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:59,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:59,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:59,894 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:59,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:59,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:59,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:01:59,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 14:01:59,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:01:59,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:01:59,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-10 14:01:59,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:01:59,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:01:59,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:01:59,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:59,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:01:59,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:59,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-10 14:02:00,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:02:00,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:02:00,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-04-10 14:02:00,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 14:02:00,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:00,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:00,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:144 [2018-04-10 14:02:00,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 114 [2018-04-10 14:02:00,280 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 94 treesize of output 92 [2018-04-10 14:02:00,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:00,323 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 110 treesize of output 91 [2018-04-10 14:02:00,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,361 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 91 treesize of output 84 [2018-04-10 14:02:00,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:02:00,431 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 111 treesize of output 95 [2018-04-10 14:02:00,433 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:02:00,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,441 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 19 treesize of output 1 [2018-04-10 14:02:00,441 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:02:00,476 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:222, output treesize:229 [2018-04-10 14:02:00,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2018-04-10 14:02:00,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:00,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:00,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-04-10 14:02:00,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,634 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 76 treesize of output 66 [2018-04-10 14:02:00,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:00,636 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 45 treesize of output 33 [2018-04-10 14:02:00,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:02:00,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:168, output treesize:97 [2018-04-10 14:02:00,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 [2018-04-10 14:02:00,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2018-04-10 14:02:00,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:00,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:00,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-04-10 14:02:00,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-10 14:02:00,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:00,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:02:00,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:59 [2018-04-10 14:02:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:02:00,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:02:00,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2018-04-10 14:02:00,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:02:00,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:02:00,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:02:00,951 INFO L87 Difference]: Start difference. First operand 266 states and 299 transitions. Second operand 32 states. [2018-04-10 14:02:01,806 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 92 DAG size of output 57 [2018-04-10 14:02:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:02:02,332 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2018-04-10 14:02:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:02:02,332 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2018-04-10 14:02:02,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:02:02,332 INFO L225 Difference]: With dead ends: 269 [2018-04-10 14:02:02,333 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 14:02:02,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=408, Invalid=1848, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:02:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 14:02:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2018-04-10 14:02:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-10 14:02:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 244 transitions. [2018-04-10 14:02:02,335 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 244 transitions. Word has length 47 [2018-04-10 14:02:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:02:02,335 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 244 transitions. [2018-04-10 14:02:02,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:02:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 244 transitions. [2018-04-10 14:02:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:02:02,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:02:02,336 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:02:02,336 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:02:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1206828682, now seen corresponding path program 1 times [2018-04-10 14:02:02,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:02:02,337 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:02:02,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:02,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:02,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:02,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:02:02,634 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:02:02,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:02:02,634 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:02:02,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:02,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:02:02,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:02,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:02,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:02:02,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:02:02,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:02:02,686 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:02:02,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:02:02,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:02:02,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,701 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:02:02,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-10 14:02:02,728 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 51 treesize of output 55 [2018-04-10 14:02:02,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:02:02,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,743 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:02:02,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:02:02,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,754 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:02:02,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-10 14:02:02,774 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 28 treesize of output 26 [2018-04-10 14:02:02,775 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:02:02,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,778 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:02:02,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,783 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:02:02,784 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2018-04-10 14:02:02,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 14:02:02,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-10 14:02:02,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,828 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:02:02,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2018-04-10 14:02:02,859 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 19 treesize of output 12 [2018-04-10 14:02:02,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:02:02,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-04-10 14:02:02,891 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 38 treesize of output 26 [2018-04-10 14:02:02,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:02:02,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-04-10 14:02:02,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:02,899 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2018-04-10 14:02:02,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:02:02,923 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:02:02,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:02,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:02,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:02,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2018-04-10 14:02:02,954 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:02:02,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:02:02,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-04-10 14:02:02,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:02:02,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:02:02,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:02:02,973 INFO L87 Difference]: Start difference. First operand 217 states and 244 transitions. Second operand 31 states. [2018-04-10 14:02:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:02:03,967 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2018-04-10 14:02:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 14:02:03,968 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 50 [2018-04-10 14:02:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:02:03,968 INFO L225 Difference]: With dead ends: 271 [2018-04-10 14:02:03,968 INFO L226 Difference]: Without dead ends: 270 [2018-04-10 14:02:03,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=2534, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 14:02:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-10 14:02:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 250. [2018-04-10 14:02:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-10 14:02:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 282 transitions. [2018-04-10 14:02:03,972 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 282 transitions. Word has length 50 [2018-04-10 14:02:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:02:03,972 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 282 transitions. [2018-04-10 14:02:03,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:02:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 282 transitions. [2018-04-10 14:02:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 14:02:03,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:02:03,973 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] [2018-04-10 14:02:03,973 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:02:03,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2063220804, now seen corresponding path program 1 times [2018-04-10 14:02:03,973 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:02:03,973 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:02:03,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:03,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:03,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:03,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:02:04,293 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:02:04,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:02:04,293 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:02:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:04,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:02:04,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:04,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:04,328 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:02:04,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:02:04,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:02:04,343 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:02:04,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:02:04,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:02:04,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,355 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:02:04,355 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:02:04,381 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 51 treesize of output 55 [2018-04-10 14:02:04,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:02:04,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,397 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:02:04,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:02:04,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:04,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-10 14:02:04,422 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 28 treesize of output 26 [2018-04-10 14:02:04,423 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:02:04,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,427 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:02:04,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,431 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:02:04,431 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:32 [2018-04-10 14:02:04,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 14:02:04,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-10 14:02:04,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,485 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:02:04,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:31 [2018-04-10 14:02:04,542 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 19 treesize of output 12 [2018-04-10 14:02:04,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:02:04,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-04-10 14:02:04,580 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 38 treesize of output 26 [2018-04-10 14:02:04,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-04-10 14:02:04,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:02:04,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:04,588 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2018-04-10 14:02:04,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:02:04,615 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:02:04,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:04,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:04,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:04,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2018-04-10 14:02:04,647 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:02:04,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:02:04,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-04-10 14:02:04,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:02:04,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:02:04,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:02:04,665 INFO L87 Difference]: Start difference. First operand 250 states and 282 transitions. Second operand 33 states. [2018-04-10 14:02:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:02:05,802 INFO L93 Difference]: Finished difference Result 270 states and 299 transitions. [2018-04-10 14:02:05,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:02:05,802 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2018-04-10 14:02:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:02:05,803 INFO L225 Difference]: With dead ends: 270 [2018-04-10 14:02:05,803 INFO L226 Difference]: Without dead ends: 269 [2018-04-10 14:02:05,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=486, Invalid=2936, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 14:02:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-10 14:02:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 216. [2018-04-10 14:02:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-10 14:02:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 241 transitions. [2018-04-10 14:02:05,807 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 241 transitions. Word has length 51 [2018-04-10 14:02:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:02:05,807 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 241 transitions. [2018-04-10 14:02:05,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:02:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 241 transitions. [2018-04-10 14:02:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 14:02:05,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:02:05,808 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:02:05,808 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:02:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1321619613, now seen corresponding path program 1 times [2018-04-10 14:02:05,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:02:05,808 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:02:05,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:05,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:05,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:05,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:02:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:02:05,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:02:05,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:02:05,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:02:05,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:02:05,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:02:05,854 INFO L87 Difference]: Start difference. First operand 216 states and 241 transitions. Second operand 3 states. [2018-04-10 14:02:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:02:05,863 INFO L93 Difference]: Finished difference Result 345 states and 381 transitions. [2018-04-10 14:02:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:02:05,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-04-10 14:02:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:02:05,864 INFO L225 Difference]: With dead ends: 345 [2018-04-10 14:02:05,864 INFO L226 Difference]: Without dead ends: 345 [2018-04-10 14:02:05,865 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:02:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-10 14:02:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 242. [2018-04-10 14:02:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 14:02:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2018-04-10 14:02:05,868 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 52 [2018-04-10 14:02:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:02:05,868 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2018-04-10 14:02:05,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:02:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2018-04-10 14:02:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:02:05,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:02:05,869 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:02:05,869 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:02:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash -983795228, now seen corresponding path program 1 times [2018-04-10 14:02:05,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:02:05,869 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:02:05,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:05,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:05,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:02:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:02:06,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:02:06,108 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:02:06,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:06,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:02:06,187 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 25 treesize of output 21 [2018-04-10 14:02:06,188 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 21 treesize of output 13 [2018-04-10 14:02:06,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:06,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:06,192 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 21 treesize of output 17 [2018-04-10 14:02:06,193 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 17 treesize of output 9 [2018-04-10 14:02:06,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:06,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:06,195 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:02:06,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2018-04-10 14:02:06,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:02:06,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:02:06,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:06,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:06,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:06,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-10 14:02:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:02:06,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:02:06,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 26 [2018-04-10 14:02:06,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:02:06,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:02:06,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:02:06,262 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand 26 states. [2018-04-10 14:02:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:02:07,862 INFO L93 Difference]: Finished difference Result 305 states and 332 transitions. [2018-04-10 14:02:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 14:02:07,863 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-04-10 14:02:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:02:07,863 INFO L225 Difference]: With dead ends: 305 [2018-04-10 14:02:07,864 INFO L226 Difference]: Without dead ends: 305 [2018-04-10 14:02:07,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1152, Invalid=5988, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 14:02:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-10 14:02:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 271. [2018-04-10 14:02:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-10 14:02:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 299 transitions. [2018-04-10 14:02:07,867 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 299 transitions. Word has length 54 [2018-04-10 14:02:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:02:07,867 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 299 transitions. [2018-04-10 14:02:07,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:02:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 299 transitions. [2018-04-10 14:02:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 14:02:07,867 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:02:07,867 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:02:07,867 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:02:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1071603689, now seen corresponding path program 2 times [2018-04-10 14:02:07,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:02:07,868 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:02:07,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:07,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:07,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:02:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:02:08,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:02:08,409 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:02:08,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:02:08,432 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:02:08,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:02:08,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:02:08,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:08,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:08,472 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:02:08,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:02:08,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:02:08,496 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:02:08,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:02:08,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:02:08,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,513 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:02:08,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:02:08,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:02:08,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:02:08,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-10 14:02:08,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:02:08,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,587 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:02:08,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-04-10 14:02:08,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-10 14:02:08,664 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 25 [2018-04-10 14:02:08,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-04-10 14:02:08,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-10 14:02:08,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:08,704 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:02:08,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:79 [2018-04-10 14:02:10,735 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-10 14:02:12,773 WARN L148 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-10 14:02:12,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:12,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:12,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:12,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 14:02:12,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:12,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-10 14:02:12,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:12,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:12,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:89 [2018-04-10 14:02:14,859 WARN L148 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-10 14:02:14,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-04-10 14:02:14,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-04-10 14:02:14,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:14,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:14,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:14,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-04-10 14:02:14,933 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 36 treesize of output 24 [2018-04-10 14:02:14,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:14,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:14,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:14,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 82 [2018-04-10 14:02:14,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 34 [2018-04-10 14:02:14,952 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:14,968 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:14,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:02:14,994 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:145 [2018-04-10 14:02:15,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:02:15,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:02:15,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 78 [2018-04-10 14:02:15,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:02:15,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,112 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:02:15,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:87 [2018-04-10 14:02:15,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 114 [2018-04-10 14:02:15,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:15,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 51 [2018-04-10 14:02:15,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:02:15,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:02:15,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 127 [2018-04-10 14:02:15,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:15,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-10 14:02:15,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 111 [2018-04-10 14:02:15,316 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 24 treesize of output 21 [2018-04-10 14:02:15,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:15,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 14:02:15,361 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:251 [2018-04-10 14:02:21,496 WARN L148 SmtUtils]: Spent 6086ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-10 14:02:21,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 98 [2018-04-10 14:02:21,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-04-10 14:02:21,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:21,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-10 14:02:21,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2018-04-10 14:02:21,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:21,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-04-10 14:02:21,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:02:21,598 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,606 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:02:21,606 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 117 [2018-04-10 14:02:21,637 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:02:21,637 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:02:21,649 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,657 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 60 [2018-04-10 14:02:21,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-04-10 14:02:21,680 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,689 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:02:21,689 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:21,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 14:02:21,697 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:21,716 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:21,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:02:21,737 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:273, output treesize:37 [2018-04-10 14:02:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:02:21,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:02:21,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2018-04-10 14:02:21,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 14:02:21,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 14:02:21,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:02:21,875 INFO L87 Difference]: Start difference. First operand 271 states and 299 transitions. Second operand 42 states. [2018-04-10 14:02:37,440 WARN L151 SmtUtils]: Spent 14062ms on a formula simplification. DAG size of input: 101 DAG size of output 83 [2018-04-10 14:02:51,676 WARN L151 SmtUtils]: Spent 14070ms on a formula simplification. DAG size of input: 111 DAG size of output 88 [2018-04-10 14:03:09,970 WARN L151 SmtUtils]: Spent 18058ms on a formula simplification. DAG size of input: 82 DAG size of output 79 [2018-04-10 14:03:28,156 WARN L151 SmtUtils]: Spent 18063ms on a formula simplification. DAG size of input: 89 DAG size of output 84 [2018-04-10 14:03:46,327 WARN L151 SmtUtils]: Spent 18083ms on a formula simplification. DAG size of input: 85 DAG size of output 80 [2018-04-10 14:03:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:03:46,460 INFO L93 Difference]: Finished difference Result 370 states and 399 transitions. [2018-04-10 14:03:46,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 14:03:46,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 56 [2018-04-10 14:03:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:03:46,461 INFO L225 Difference]: With dead ends: 370 [2018-04-10 14:03:46,461 INFO L226 Difference]: Without dead ends: 370 [2018-04-10 14:03:46,462 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 96.8s TimeCoverageRelationStatistics Valid=790, Invalid=4040, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 14:03:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-10 14:03:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 274. [2018-04-10 14:03:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-10 14:03:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2018-04-10 14:03:46,464 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 56 [2018-04-10 14:03:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:03:46,464 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2018-04-10 14:03:46,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 14:03:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2018-04-10 14:03:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 14:03:46,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:03:46,465 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:03:46,465 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:03:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1707370776, now seen corresponding path program 1 times [2018-04-10 14:03:46,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:03:46,465 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:03:46,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:46,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:03:46,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:46,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:03:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:46,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:03:46,651 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:03:46,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:46,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:03:46,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 61 [2018-04-10 14:03:46,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-04-10 14:03:46,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 53 [2018-04-10 14:03:46,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-04-10 14:03:46,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:43 [2018-04-10 14:03:46,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2018-04-10 14:03:46,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-04-10 14:03:46,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-10 14:03:46,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:46,890 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2018-04-10 14:03:46,891 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:46,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:03:46,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:03:46,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:89 [2018-04-10 14:03:46,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2018-04-10 14:03:46,960 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 18 treesize of output 14 [2018-04-10 14:03:46,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:46,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-10 14:03:46,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,973 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 5 [2018-04-10 14:03:46,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:46,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:46,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:11 [2018-04-10 14:03:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:47,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:03:47,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-04-10 14:03:47,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 14:03:47,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 14:03:47,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:03:47,012 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand 25 states. [2018-04-10 14:03:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:03:47,684 INFO L93 Difference]: Finished difference Result 307 states and 334 transitions. [2018-04-10 14:03:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:03:47,685 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-04-10 14:03:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:03:47,685 INFO L225 Difference]: With dead ends: 307 [2018-04-10 14:03:47,685 INFO L226 Difference]: Without dead ends: 307 [2018-04-10 14:03:47,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:03:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-10 14:03:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 275. [2018-04-10 14:03:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-10 14:03:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 304 transitions. [2018-04-10 14:03:47,688 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 304 transitions. Word has length 59 [2018-04-10 14:03:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:03:47,688 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 304 transitions. [2018-04-10 14:03:47,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 14:03:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 304 transitions. [2018-04-10 14:03:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 14:03:47,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:03:47,688 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:03:47,689 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:03:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1707370775, now seen corresponding path program 1 times [2018-04-10 14:03:47,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:03:47,689 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:03:47,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:47,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:47,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:47,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:03:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:47,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:03:47,874 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:03:47,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:47,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:03:47,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:03:47,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:47,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:47,907 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:03:47,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:03:47,916 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:03:47,917 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:03:47,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,925 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:03:47,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:03:47,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,932 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:03:47,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:03:47,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 14:03:47,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:03:47,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,971 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:03:47,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:03:47,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:47,981 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:03:47,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-10 14:03:48,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2018-04-10 14:03:48,047 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 24 treesize of output 29 [2018-04-10 14:03:48,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,068 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 59 treesize of output 54 [2018-04-10 14:03:48,070 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 24 treesize of output 29 [2018-04-10 14:03:48,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:48,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:81 [2018-04-10 14:03:48,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 79 [2018-04-10 14:03:48,231 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 33 treesize of output 17 [2018-04-10 14:03:48,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,237 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 59 treesize of output 36 [2018-04-10 14:03:48,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,247 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 34 treesize of output 26 [2018-04-10 14:03:48,248 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 17 treesize of output 5 [2018-04-10 14:03:48,248 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,251 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:03:48,251 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:48,254 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:03:48,254 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:117, output treesize:9 [2018-04-10 14:03:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:48,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:03:48,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2018-04-10 14:03:48,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:03:48,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:03:48,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:03:48,292 INFO L87 Difference]: Start difference. First operand 275 states and 304 transitions. Second operand 24 states. [2018-04-10 14:03:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:03:48,980 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2018-04-10 14:03:48,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:03:48,980 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-04-10 14:03:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:03:48,981 INFO L225 Difference]: With dead ends: 306 [2018-04-10 14:03:48,981 INFO L226 Difference]: Without dead ends: 306 [2018-04-10 14:03:48,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:03:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-10 14:03:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 275. [2018-04-10 14:03:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-10 14:03:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2018-04-10 14:03:48,984 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 59 [2018-04-10 14:03:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:03:48,985 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2018-04-10 14:03:48,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:03:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2018-04-10 14:03:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:03:48,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:03:48,985 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:03:48,985 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:03:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2146960817, now seen corresponding path program 2 times [2018-04-10 14:03:48,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:03:48,986 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:03:48,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:48,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:49,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:03:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:49,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:03:49,324 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:03:49,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:03:49,352 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:03:49,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:03:49,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:03:49,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,411 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:03:49,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:03:49,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:49,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:03:49,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:49,456 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:03:49,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,468 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:03:49,468 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:03:49,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 14:03:49,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:03:49,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,542 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:03:49,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:03:49,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,554 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:03:49,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-04-10 14:03:49,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-04-10 14:03:49,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-10 14:03:49,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-04-10 14:03:49,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-04-10 14:03:49,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,705 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:03:49,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:91 [2018-04-10 14:03:49,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-10 14:03:49,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:86 [2018-04-10 14:03:49,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-04-10 14:03:49,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-04-10 14:03:49,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 82 [2018-04-10 14:03:49,855 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 66 [2018-04-10 14:03:49,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:03:49,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,877 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:03:49,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:80 [2018-04-10 14:03:49,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,939 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 77 treesize of output 78 [2018-04-10 14:03:49,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:03:49,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:49,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 116 [2018-04-10 14:03:49,965 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:03:49,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:49,988 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:03:49,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:122, output treesize:94 [2018-04-10 14:03:50,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 155 [2018-04-10 14:03:50,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:50,135 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 32 treesize of output 48 [2018-04-10 14:03:50,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:50,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:50,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:50,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:50,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 136 [2018-04-10 14:03:50,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:50,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 59 [2018-04-10 14:03:50,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:50,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:03:50,215 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:03:50,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:198, output treesize:283 Received shutdown request... [2018-04-10 14:04:06,289 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 14:04:06,289 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:04:06,292 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:04:06,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:04:06 BoogieIcfgContainer [2018-04-10 14:04:06,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:04:06,293 INFO L168 Benchmark]: Toolchain (without parser) took 209156.24 ms. Allocated memory was 402.7 MB in the beginning and 707.3 MB in the end (delta: 304.6 MB). Free memory was 340.4 MB in the beginning and 493.1 MB in the end (delta: -152.7 MB). Peak memory consumption was 151.9 MB. Max. memory is 5.3 GB. [2018-04-10 14:04:06,294 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.7 MB. Free memory is still 365.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:04:06,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.92 ms. Allocated memory is still 402.7 MB. Free memory was 339.0 MB in the beginning and 312.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:04:06,294 INFO L168 Benchmark]: Boogie Preprocessor took 50.57 ms. Allocated memory is still 402.7 MB. Free memory was 312.6 MB in the beginning and 310.0 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:04:06,295 INFO L168 Benchmark]: RCFGBuilder took 487.09 ms. Allocated memory was 402.7 MB in the beginning and 611.3 MB in the end (delta: 208.7 MB). Free memory was 310.0 MB in the beginning and 535.1 MB in the end (delta: -225.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-04-10 14:04:06,295 INFO L168 Benchmark]: TraceAbstraction took 208344.46 ms. Allocated memory was 611.3 MB in the beginning and 707.3 MB in the end (delta: 95.9 MB). Free memory was 533.3 MB in the beginning and 493.1 MB in the end (delta: 40.2 MB). Peak memory consumption was 136.2 MB. Max. memory is 5.3 GB. [2018-04-10 14:04:06,296 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 402.7 MB. Free memory is still 365.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 270.92 ms. Allocated memory is still 402.7 MB. Free memory was 339.0 MB in the beginning and 312.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.57 ms. Allocated memory is still 402.7 MB. Free memory was 312.6 MB in the beginning and 310.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 487.09 ms. Allocated memory was 402.7 MB in the beginning and 611.3 MB in the end (delta: 208.7 MB). Free memory was 310.0 MB in the beginning and 535.1 MB in the end (delta: -225.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 208344.46 ms. Allocated memory was 611.3 MB in the beginning and 707.3 MB in the end (delta: 95.9 MB). Free memory was 533.3 MB in the beginning and 493.1 MB in the end (delta: 40.2 MB). Peak memory consumption was 136.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 54. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 117 locations, 47 error locations. TIMEOUT Result, 208.2s OverallTime, 40 OverallIterations, 3 TraceHistogramMax, 157.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2687 SDtfs, 13841 SDslu, 15972 SDs, 0 SdLazy, 18689 SolverSat, 1376 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1769 GetRequests, 757 SyntacticMatches, 58 SemanticMatches, 954 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9115 ImplicationChecksByTransitivity, 168.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=38, 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, 39 MinimizatonAttempts, 1433 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 2204 NumberOfCodeBlocks, 2204 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2146 ConstructedInterpolants, 253 QuantifiedInterpolants, 1936321 SizeOfPredicates, 230 NumberOfNonLiveVariables, 3310 ConjunctsInSsa, 628 ConjunctsInUnsatCore, 58 InterpolantComputations, 26 PerfectInterpolantSequences, 57/230 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-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-04-06-302.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-04-06-302.csv Completed graceful shutdown