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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 18:20:47,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 18:20:47,909 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 18:20:47,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 18:20:47,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 18:20:47,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 18:20:47,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 18:20:47,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 18:20:47,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 18:20:47,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 18:20:47,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 18:20:47,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 18:20:47,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 18:20:47,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 18:20:47,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 18:20:47,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 18:20:47,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 18:20:47,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 18:20:47,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 18:20:47,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 18:20:47,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 18:20:47,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 18:20:47,941 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 18:20:47,942 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 18:20:47,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 18:20:47,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 18:20:47,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 18:20:47,944 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 18:20:47,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 18:20:47,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 18:20:47,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 18:20:47,946 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-12 18:20:47,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 18:20:47,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 18:20:47,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 18:20:47,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 18:20:47,958 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 18:20:47,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 18:20:47,959 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 18:20:47,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 18:20:47,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 18:20:47,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 18:20:47,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 18:20:47,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 18:20:47,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 18:20:47,960 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 18:20:47,960 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 18:20:47,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 18:20:47,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 18:20:48,000 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 18:20:48,003 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 18:20:48,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 18:20:48,004 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 18:20:48,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,284 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1fb4cfa0a [2018-04-12 18:20:48,423 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 18:20:48,423 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 18:20:48,424 INFO L168 CDTParser]: Scanning sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,431 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 18:20:48,431 INFO L215 ultiparseSymbolTable]: [2018-04-12 18:20:48,431 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 18:20:48,432 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,432 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 18:20:48,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ulong in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_set in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__div_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ushort in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__SLL in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____useconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsword_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__register_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uint in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____socklen_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____intptr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__size_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__idtype_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__wchar_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:48,456 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1fb4cfa0a [2018-04-12 18:20:48,459 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 18:20:48,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 18:20:48,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 18:20:48,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 18:20:48,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 18:20:48,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403bdb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48, skipping insertion in model container [2018-04-12 18:20:48,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,477 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:20:48,504 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:20:48,649 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:20:48,690 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:20:48,696 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-12 18:20:48,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48 WrapperNode [2018-04-12 18:20:48,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 18:20:48,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 18:20:48,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 18:20:48,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 18:20:48,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (1/1) ... [2018-04-12 18:20:48,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 18:20:48,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 18:20:48,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 18:20:48,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 18:20:48,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (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-12 18:20:48,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 18:20:48,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 18:20:48,875 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 18:20:48,875 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 18:20:48,875 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 18:20:48,876 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 18:20:48,877 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 18:20:48,878 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 18:20:48,879 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 18:20:48,880 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 18:20:48,881 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 18:20:48,882 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 18:20:48,883 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 18:20:48,884 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 18:20:48,885 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 18:20:48,886 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 18:20:48,887 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 18:20:49,334 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 18:20:49,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:20:49 BoogieIcfgContainer [2018-04-12 18:20:49,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 18:20:49,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 18:20:49,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 18:20:49,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 18:20:49,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:20:48" (1/3) ... [2018-04-12 18:20:49,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2ca081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:20:49, skipping insertion in model container [2018-04-12 18:20:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:20:48" (2/3) ... [2018-04-12 18:20:49,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2ca081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:20:49, skipping insertion in model container [2018-04-12 18:20:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:20:49" (3/3) ... [2018-04-12 18:20:49,345 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:20:49,351 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 18:20:49,359 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-12 18:20:49,383 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 18:20:49,384 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 18:20:49,384 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 18:20:49,384 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 18:20:49,384 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 18:20:49,384 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 18:20:49,384 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 18:20:49,384 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 18:20:49,384 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 18:20:49,385 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 18:20:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2018-04-12 18:20:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:20:49,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:49,403 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:49,403 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 166545801, now seen corresponding path program 1 times [2018-04-12 18:20:49,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:49,408 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:49,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:49,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:49,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:49,472 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:49,525 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-12 18:20:49,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:49,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:20:49,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:20:49,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:20:49,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:20:49,545 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 4 states. [2018-04-12 18:20:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:49,752 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-04-12 18:20:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:20:49,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:20:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:49,766 INFO L225 Difference]: With dead ends: 218 [2018-04-12 18:20:49,766 INFO L226 Difference]: Without dead ends: 214 [2018-04-12 18:20:49,767 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-12 18:20:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-12 18:20:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2018-04-12 18:20:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-12 18:20:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-04-12 18:20:49,799 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 8 [2018-04-12 18:20:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:49,800 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-04-12 18:20:49,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:20:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2018-04-12 18:20:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:20:49,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:49,800 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:49,800 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash 166545802, now seen corresponding path program 1 times [2018-04-12 18:20:49,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:49,801 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:49,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:49,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:49,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:49,815 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:49,839 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-12 18:20:49,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:49,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:20:49,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:20:49,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:20:49,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:20:49,841 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 4 states. [2018-04-12 18:20:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:49,950 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-04-12 18:20:49,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:20:49,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:20:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:49,951 INFO L225 Difference]: With dead ends: 207 [2018-04-12 18:20:49,951 INFO L226 Difference]: Without dead ends: 207 [2018-04-12 18:20:49,952 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-12 18:20:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-12 18:20:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-12 18:20:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-12 18:20:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-12 18:20:49,962 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 8 [2018-04-12 18:20:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:49,962 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-12 18:20:49,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:20:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-12 18:20:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 18:20:49,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:49,963 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:49,963 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:49,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322413, now seen corresponding path program 1 times [2018-04-12 18:20:49,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:49,964 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:49,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:49,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:49,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:49,978 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:50,005 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-12 18:20:50,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:50,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:20:50,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:20:50,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:20:50,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:20:50,006 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 5 states. [2018-04-12 18:20:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:50,263 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-04-12 18:20:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:20:50,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-12 18:20:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:50,265 INFO L225 Difference]: With dead ends: 329 [2018-04-12 18:20:50,265 INFO L226 Difference]: Without dead ends: 329 [2018-04-12 18:20:50,265 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-12 18:20:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-12 18:20:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 193. [2018-04-12 18:20:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-12 18:20:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2018-04-12 18:20:50,273 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 17 [2018-04-12 18:20:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:50,274 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-04-12 18:20:50,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:20:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2018-04-12 18:20:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 18:20:50,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:50,274 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:50,274 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322412, now seen corresponding path program 1 times [2018-04-12 18:20:50,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:50,274 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:50,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:50,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:50,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:50,287 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:50,316 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-12 18:20:50,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:50,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:20:50,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:20:50,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:20:50,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:20:50,317 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand 5 states. [2018-04-12 18:20:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:50,526 INFO L93 Difference]: Finished difference Result 360 states and 397 transitions. [2018-04-12 18:20:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:20:50,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-12 18:20:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:50,528 INFO L225 Difference]: With dead ends: 360 [2018-04-12 18:20:50,528 INFO L226 Difference]: Without dead ends: 360 [2018-04-12 18:20:50,528 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-12 18:20:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-04-12 18:20:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 192. [2018-04-12 18:20:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-12 18:20:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-04-12 18:20:50,534 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 17 [2018-04-12 18:20:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:50,534 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-04-12 18:20:50,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:20:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-04-12 18:20:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 18:20:50,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:50,535 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:50,535 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash -337938114, now seen corresponding path program 1 times [2018-04-12 18:20:50,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:50,535 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:50,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:50,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:50,553 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:50,607 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-12 18:20:50,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:50,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:20:50,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 18:20:50,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 18:20:50,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 18:20:50,608 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 8 states. [2018-04-12 18:20:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:51,037 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2018-04-12 18:20:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:20:51,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-12 18:20:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:51,038 INFO L225 Difference]: With dead ends: 332 [2018-04-12 18:20:51,038 INFO L226 Difference]: Without dead ends: 332 [2018-04-12 18:20:51,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-12 18:20:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-12 18:20:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 191. [2018-04-12 18:20:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-12 18:20:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-04-12 18:20:51,041 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 20 [2018-04-12 18:20:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:51,041 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-04-12 18:20:51,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 18:20:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2018-04-12 18:20:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 18:20:51,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:51,042 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:51,042 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash -337938113, now seen corresponding path program 1 times [2018-04-12 18:20:51,042 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:51,042 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:51,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:51,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:51,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:51,052 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:51,125 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-12 18:20:51,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:51,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:20:51,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 18:20:51,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 18:20:51,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 18:20:51,126 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand 8 states. [2018-04-12 18:20:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:51,733 INFO L93 Difference]: Finished difference Result 334 states and 359 transitions. [2018-04-12 18:20:51,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:20:51,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-12 18:20:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:51,736 INFO L225 Difference]: With dead ends: 334 [2018-04-12 18:20:51,736 INFO L226 Difference]: Without dead ends: 334 [2018-04-12 18:20:51,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-12 18:20:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-12 18:20:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 190. [2018-04-12 18:20:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-12 18:20:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2018-04-12 18:20:51,741 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 20 [2018-04-12 18:20:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:51,741 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2018-04-12 18:20:51,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 18:20:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2018-04-12 18:20:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 18:20:51,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:51,742 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-12 18:20:51,742 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash -296054905, now seen corresponding path program 1 times [2018-04-12 18:20:51,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:51,742 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:51,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:51,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:51,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:51,752 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:51,780 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-12 18:20:51,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:51,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:20:51,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:20:51,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:20:51,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:20:51,781 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 5 states. [2018-04-12 18:20:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:51,896 INFO L93 Difference]: Finished difference Result 282 states and 306 transitions. [2018-04-12 18:20:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:20:51,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-12 18:20:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:51,898 INFO L225 Difference]: With dead ends: 282 [2018-04-12 18:20:51,898 INFO L226 Difference]: Without dead ends: 282 [2018-04-12 18:20:51,898 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-12 18:20:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-12 18:20:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 194. [2018-04-12 18:20:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-12 18:20:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-12 18:20:51,902 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 26 [2018-04-12 18:20:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:51,903 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-12 18:20:51,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:20:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-12 18:20:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 18:20:51,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:51,904 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:51,904 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684908, now seen corresponding path program 1 times [2018-04-12 18:20:51,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:51,904 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:51,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:51,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:51,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:51,914 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:51,940 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-12 18:20:51,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:51,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:20:51,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:20:51,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:20:51,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:20:51,941 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 4 states. [2018-04-12 18:20:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:52,045 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2018-04-12 18:20:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:20:52,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-12 18:20:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:52,047 INFO L225 Difference]: With dead ends: 198 [2018-04-12 18:20:52,047 INFO L226 Difference]: Without dead ends: 198 [2018-04-12 18:20:52,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:20:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-12 18:20:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-04-12 18:20:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 18:20:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-04-12 18:20:52,052 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 28 [2018-04-12 18:20:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:52,052 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-04-12 18:20:52,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:20:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-04-12 18:20:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 18:20:52,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:52,053 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:52,053 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684909, now seen corresponding path program 1 times [2018-04-12 18:20:52,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:52,054 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:52,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:52,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:52,064 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:52,130 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-12 18:20:52,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:52,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 18:20:52,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 18:20:52,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 18:20:52,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:20:52,131 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 7 states. [2018-04-12 18:20:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:52,318 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2018-04-12 18:20:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:20:52,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-12 18:20:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:52,319 INFO L225 Difference]: With dead ends: 240 [2018-04-12 18:20:52,319 INFO L226 Difference]: Without dead ends: 240 [2018-04-12 18:20:52,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:20:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-12 18:20:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 213. [2018-04-12 18:20:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 18:20:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 240 transitions. [2018-04-12 18:20:52,324 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 240 transitions. Word has length 28 [2018-04-12 18:20:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:52,325 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 240 transitions. [2018-04-12 18:20:52,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 18:20:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 240 transitions. [2018-04-12 18:20:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 18:20:52,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:52,326 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-12 18:20:52,326 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash 265761851, now seen corresponding path program 1 times [2018-04-12 18:20:52,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:52,326 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:52,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:52,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:52,336 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:52,364 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-12 18:20:52,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:52,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:20:52,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:20:52,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:20:52,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:20:52,365 INFO L87 Difference]: Start difference. First operand 213 states and 240 transitions. Second operand 6 states. [2018-04-12 18:20:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:52,580 INFO L93 Difference]: Finished difference Result 305 states and 345 transitions. [2018-04-12 18:20:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:20:52,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-12 18:20:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:52,581 INFO L225 Difference]: With dead ends: 305 [2018-04-12 18:20:52,581 INFO L226 Difference]: Without dead ends: 305 [2018-04-12 18:20:52,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:20:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-12 18:20:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 212. [2018-04-12 18:20:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-12 18:20:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 239 transitions. [2018-04-12 18:20:52,585 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 239 transitions. Word has length 31 [2018-04-12 18:20:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:52,586 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 239 transitions. [2018-04-12 18:20:52,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:20:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 239 transitions. [2018-04-12 18:20:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 18:20:52,586 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:52,587 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-12 18:20:52,587 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 265761852, now seen corresponding path program 1 times [2018-04-12 18:20:52,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:52,587 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:52,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:52,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:52,595 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:52,636 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-12 18:20:52,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:52,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:20:52,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:20:52,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:20:52,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:20:52,636 INFO L87 Difference]: Start difference. First operand 212 states and 239 transitions. Second operand 6 states. [2018-04-12 18:20:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:52,816 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2018-04-12 18:20:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 18:20:52,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-12 18:20:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:52,818 INFO L225 Difference]: With dead ends: 329 [2018-04-12 18:20:52,818 INFO L226 Difference]: Without dead ends: 329 [2018-04-12 18:20:52,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:20:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-12 18:20:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 197. [2018-04-12 18:20:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-12 18:20:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 223 transitions. [2018-04-12 18:20:52,822 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 223 transitions. Word has length 31 [2018-04-12 18:20:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:52,822 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 223 transitions. [2018-04-12 18:20:52,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:20:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 223 transitions. [2018-04-12 18:20:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 18:20:52,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:52,823 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:52,823 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:52,823 INFO L82 PathProgramCache]: Analyzing trace with hash -788385734, now seen corresponding path program 1 times [2018-04-12 18:20:52,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:52,823 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:52,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:52,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:52,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:52,862 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-12 18:20:52,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:52,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:20:52,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:20:52,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:20:52,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:20:52,863 INFO L87 Difference]: Start difference. First operand 197 states and 223 transitions. Second operand 5 states. [2018-04-12 18:20:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:52,914 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-04-12 18:20:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:20:52,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-12 18:20:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:52,915 INFO L225 Difference]: With dead ends: 220 [2018-04-12 18:20:52,915 INFO L226 Difference]: Without dead ends: 220 [2018-04-12 18:20:52,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:20:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-12 18:20:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 197. [2018-04-12 18:20:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-12 18:20:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 221 transitions. [2018-04-12 18:20:52,919 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 221 transitions. Word has length 36 [2018-04-12 18:20:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:52,919 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 221 transitions. [2018-04-12 18:20:52,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:20:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 221 transitions. [2018-04-12 18:20:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 18:20:52,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:52,920 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:52,921 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2065889067, now seen corresponding path program 1 times [2018-04-12 18:20:52,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:52,921 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:52,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:52,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:52,930 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:52,997 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-12 18:20:52,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:52,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 18:20:52,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 18:20:52,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 18:20:52,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-12 18:20:52,998 INFO L87 Difference]: Start difference. First operand 197 states and 221 transitions. Second operand 8 states. [2018-04-12 18:20:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:53,238 INFO L93 Difference]: Finished difference Result 302 states and 333 transitions. [2018-04-12 18:20:53,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 18:20:53,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-12 18:20:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:53,239 INFO L225 Difference]: With dead ends: 302 [2018-04-12 18:20:53,239 INFO L226 Difference]: Without dead ends: 302 [2018-04-12 18:20:53,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-04-12 18:20:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-12 18:20:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 213. [2018-04-12 18:20:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 18:20:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 238 transitions. [2018-04-12 18:20:53,242 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 238 transitions. Word has length 42 [2018-04-12 18:20:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:53,242 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 238 transitions. [2018-04-12 18:20:53,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 18:20:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 238 transitions. [2018-04-12 18:20:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 18:20:53,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:53,243 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:53,243 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310599, now seen corresponding path program 1 times [2018-04-12 18:20:53,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:53,244 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:53,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:53,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:53,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:53,254 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:53,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:53,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:20:53,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:20:53,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:20:53,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:20:53,295 INFO L87 Difference]: Start difference. First operand 213 states and 238 transitions. Second operand 5 states. [2018-04-12 18:20:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:53,464 INFO L93 Difference]: Finished difference Result 363 states and 410 transitions. [2018-04-12 18:20:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:20:53,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-12 18:20:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:53,465 INFO L225 Difference]: With dead ends: 363 [2018-04-12 18:20:53,465 INFO L226 Difference]: Without dead ends: 363 [2018-04-12 18:20:53,465 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-12 18:20:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-12 18:20:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 212. [2018-04-12 18:20:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-12 18:20:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-04-12 18:20:53,470 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 43 [2018-04-12 18:20:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:53,470 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-04-12 18:20:53,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:20:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-04-12 18:20:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 18:20:53,471 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:53,471 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:53,471 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310600, now seen corresponding path program 1 times [2018-04-12 18:20:53,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:53,472 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:53,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:53,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:53,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:53,482 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:53,509 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-12 18:20:53,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:53,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:20:53,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:20:53,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:20:53,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:20:53,511 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 5 states. [2018-04-12 18:20:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:53,716 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2018-04-12 18:20:53,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:20:53,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-12 18:20:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:53,717 INFO L225 Difference]: With dead ends: 327 [2018-04-12 18:20:53,717 INFO L226 Difference]: Without dead ends: 327 [2018-04-12 18:20:53,718 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-12 18:20:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-12 18:20:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 211. [2018-04-12 18:20:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-12 18:20:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2018-04-12 18:20:53,723 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 43 [2018-04-12 18:20:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:53,723 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2018-04-12 18:20:53,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:20:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2018-04-12 18:20:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-12 18:20:53,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:53,724 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-12 18:20:53,724 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash 928654395, now seen corresponding path program 1 times [2018-04-12 18:20:53,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:53,724 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:53,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:53,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:53,732 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:53,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:20:53,783 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-12 18:20:53,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:53,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:20:53,893 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-12 18:20:53,896 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-12 18:20:53,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,906 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-12 18:20:53,908 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-12 18:20:53,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-12 18:20:53,934 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-12 18:20:53,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:53,938 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-12 18:20:53,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,956 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-12 18:20:53,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:53,959 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-12 18:20:53,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:53,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-12 18:20:54,036 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-12 18:20:54,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:54,041 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-12 18:20:54,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:54,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:54,055 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-12 18:20:54,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:54,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:20:54,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:54,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:54,069 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-12 18:20:54,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-04-12 18:20:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:54,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:20:54,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-04-12 18:20:54,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 18:20:54,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 18:20:54,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:20:54,110 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand 11 states. [2018-04-12 18:20:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:54,630 INFO L93 Difference]: Finished difference Result 349 states and 375 transitions. [2018-04-12 18:20:54,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 18:20:54,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-04-12 18:20:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:54,636 INFO L225 Difference]: With dead ends: 349 [2018-04-12 18:20:54,636 INFO L226 Difference]: Without dead ends: 349 [2018-04-12 18:20:54,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-04-12 18:20:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-12 18:20:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 245. [2018-04-12 18:20:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-12 18:20:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 279 transitions. [2018-04-12 18:20:54,643 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 279 transitions. Word has length 44 [2018-04-12 18:20:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:54,644 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 279 transitions. [2018-04-12 18:20:54,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 18:20:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 279 transitions. [2018-04-12 18:20:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:20:54,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:54,644 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:54,644 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash -819000242, now seen corresponding path program 1 times [2018-04-12 18:20:54,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:54,645 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:54,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:54,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:54,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:54,664 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:54,733 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-12 18:20:54,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:54,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:20:54,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 18:20:54,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 18:20:54,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 18:20:54,735 INFO L87 Difference]: Start difference. First operand 245 states and 279 transitions. Second operand 8 states. [2018-04-12 18:20:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:55,046 INFO L93 Difference]: Finished difference Result 262 states and 298 transitions. [2018-04-12 18:20:55,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 18:20:55,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-12 18:20:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:55,049 INFO L225 Difference]: With dead ends: 262 [2018-04-12 18:20:55,050 INFO L226 Difference]: Without dead ends: 262 [2018-04-12 18:20:55,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-12 18:20:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-12 18:20:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2018-04-12 18:20:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-12 18:20:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 278 transitions. [2018-04-12 18:20:55,055 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 278 transitions. Word has length 46 [2018-04-12 18:20:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:55,055 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 278 transitions. [2018-04-12 18:20:55,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 18:20:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 278 transitions. [2018-04-12 18:20:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:20:55,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:55,056 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:55,056 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash -819000241, now seen corresponding path program 1 times [2018-04-12 18:20:55,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:55,057 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:55,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:55,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:55,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:55,068 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:55,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-12 18:20:55,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:55,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:20:55,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 18:20:55,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 18:20:55,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 18:20:55,141 INFO L87 Difference]: Start difference. First operand 244 states and 278 transitions. Second operand 8 states. [2018-04-12 18:20:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:55,416 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2018-04-12 18:20:55,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 18:20:55,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-12 18:20:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:55,417 INFO L225 Difference]: With dead ends: 261 [2018-04-12 18:20:55,417 INFO L226 Difference]: Without dead ends: 261 [2018-04-12 18:20:55,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-12 18:20:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-12 18:20:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2018-04-12 18:20:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-12 18:20:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 277 transitions. [2018-04-12 18:20:55,419 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 277 transitions. Word has length 46 [2018-04-12 18:20:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:55,419 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 277 transitions. [2018-04-12 18:20:55,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 18:20:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2018-04-12 18:20:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 18:20:55,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:55,420 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:55,420 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 410486952, now seen corresponding path program 1 times [2018-04-12 18:20:55,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:55,420 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:55,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:55,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:55,428 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:55,616 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-12 18:20:55,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:55,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-12 18:20:55,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 18:20:55,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 18:20:55,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-12 18:20:55,617 INFO L87 Difference]: Start difference. First operand 243 states and 277 transitions. Second operand 17 states. [2018-04-12 18:20:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:56,593 INFO L93 Difference]: Finished difference Result 542 states and 583 transitions. [2018-04-12 18:20:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 18:20:56,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-12 18:20:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:56,596 INFO L225 Difference]: With dead ends: 542 [2018-04-12 18:20:56,596 INFO L226 Difference]: Without dead ends: 542 [2018-04-12 18:20:56,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 18:20:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-04-12 18:20:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 249. [2018-04-12 18:20:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-12 18:20:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2018-04-12 18:20:56,604 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 47 [2018-04-12 18:20:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:56,604 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2018-04-12 18:20:56,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 18:20:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2018-04-12 18:20:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 18:20:56,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:56,605 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:56,605 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 410486953, now seen corresponding path program 1 times [2018-04-12 18:20:56,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:56,605 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:56,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:56,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:56,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:56,618 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:56,881 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-12 18:20:56,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:56,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-12 18:20:56,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 18:20:56,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 18:20:56,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-12 18:20:56,882 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand 17 states. [2018-04-12 18:20:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:58,297 INFO L93 Difference]: Finished difference Result 607 states and 650 transitions. [2018-04-12 18:20:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 18:20:58,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-12 18:20:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:58,299 INFO L225 Difference]: With dead ends: 607 [2018-04-12 18:20:58,299 INFO L226 Difference]: Without dead ends: 607 [2018-04-12 18:20:58,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 18:20:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-04-12 18:20:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 256. [2018-04-12 18:20:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-12 18:20:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 288 transitions. [2018-04-12 18:20:58,306 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 288 transitions. Word has length 47 [2018-04-12 18:20:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:58,306 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 288 transitions. [2018-04-12 18:20:58,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 18:20:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 288 transitions. [2018-04-12 18:20:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-12 18:20:58,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:58,307 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:58,307 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1107305343, now seen corresponding path program 1 times [2018-04-12 18:20:58,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:58,308 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:58,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:58,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:58,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:58,315 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:20:58,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:20:58,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:20:58,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 18:20:58,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 18:20:58,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:20:58,370 INFO L87 Difference]: Start difference. First operand 256 states and 288 transitions. Second operand 7 states. [2018-04-12 18:20:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:58,498 INFO L93 Difference]: Finished difference Result 276 states and 308 transitions. [2018-04-12 18:20:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:20:58,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-12 18:20:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:58,499 INFO L225 Difference]: With dead ends: 276 [2018-04-12 18:20:58,500 INFO L226 Difference]: Without dead ends: 276 [2018-04-12 18:20:58,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:20:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-12 18:20:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2018-04-12 18:20:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-12 18:20:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 300 transitions. [2018-04-12 18:20:58,502 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 300 transitions. Word has length 53 [2018-04-12 18:20:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:58,503 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 300 transitions. [2018-04-12 18:20:58,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 18:20:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 300 transitions. [2018-04-12 18:20:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 18:20:58,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:58,503 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:58,503 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash 815273570, now seen corresponding path program 1 times [2018-04-12 18:20:58,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:58,504 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:58,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:58,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:58,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:58,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:58,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:20:58,559 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-12 18:20:58,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:58,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:20:58,612 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-12 18:20:58,614 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-12 18:20:58,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:58,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:58,624 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-12 18:20:58,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:20:58,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:58,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:58,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:58,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-12 18:20:58,775 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-12 18:20:58,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:58,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:58,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-04-12 18:20:58,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:20:58,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:20:58,809 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-12 18:20:58,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:58,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:58,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-04-12 18:20:58,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:20:58,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:20:58,839 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-12 18:20:58,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-04-12 18:20:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:58,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:20:58,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-04-12 18:20:58,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 18:20:58,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 18:20:58,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-04-12 18:20:58,952 INFO L87 Difference]: Start difference. First operand 268 states and 300 transitions. Second operand 17 states. [2018-04-12 18:20:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:59,941 INFO L93 Difference]: Finished difference Result 544 states and 580 transitions. [2018-04-12 18:20:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 18:20:59,942 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-04-12 18:20:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:59,943 INFO L225 Difference]: With dead ends: 544 [2018-04-12 18:20:59,944 INFO L226 Difference]: Without dead ends: 544 [2018-04-12 18:20:59,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1097, Unknown=4, NotChecked=0, Total=1332 [2018-04-12 18:20:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-12 18:20:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 300. [2018-04-12 18:20:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-12 18:20:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 339 transitions. [2018-04-12 18:20:59,951 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 339 transitions. Word has length 57 [2018-04-12 18:20:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:59,951 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 339 transitions. [2018-04-12 18:20:59,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 18:20:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 339 transitions. [2018-04-12 18:20:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 18:20:59,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:59,952 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:59,952 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 680833506, now seen corresponding path program 1 times [2018-04-12 18:20:59,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:59,953 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:59,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:59,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:59,964 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:21:00,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:00,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 18:21:00,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 18:21:00,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 18:21:00,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:21:00,052 INFO L87 Difference]: Start difference. First operand 300 states and 339 transitions. Second operand 10 states. [2018-04-12 18:21:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:00,324 INFO L93 Difference]: Finished difference Result 341 states and 376 transitions. [2018-04-12 18:21:00,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 18:21:00,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-04-12 18:21:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:00,325 INFO L225 Difference]: With dead ends: 341 [2018-04-12 18:21:00,325 INFO L226 Difference]: Without dead ends: 341 [2018-04-12 18:21:00,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-04-12 18:21:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-12 18:21:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 310. [2018-04-12 18:21:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-12 18:21:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 351 transitions. [2018-04-12 18:21:00,328 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 351 transitions. Word has length 58 [2018-04-12 18:21:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:00,328 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 351 transitions. [2018-04-12 18:21:00,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 18:21:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 351 transitions. [2018-04-12 18:21:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 18:21:00,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:00,329 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:00,329 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:00,329 INFO L82 PathProgramCache]: Analyzing trace with hash 680833507, now seen corresponding path program 1 times [2018-04-12 18:21:00,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:00,329 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:00,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:00,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:00,338 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:21:00,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:00,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 18:21:00,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 18:21:00,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 18:21:00,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-12 18:21:00,556 INFO L87 Difference]: Start difference. First operand 310 states and 351 transitions. Second operand 12 states. [2018-04-12 18:21:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:01,026 INFO L93 Difference]: Finished difference Result 351 states and 382 transitions. [2018-04-12 18:21:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 18:21:01,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-12 18:21:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:01,027 INFO L225 Difference]: With dead ends: 351 [2018-04-12 18:21:01,027 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 18:21:01,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-04-12 18:21:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 18:21:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 310. [2018-04-12 18:21:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-12 18:21:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 350 transitions. [2018-04-12 18:21:01,032 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 350 transitions. Word has length 58 [2018-04-12 18:21:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:01,033 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 350 transitions. [2018-04-12 18:21:01,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 18:21:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 350 transitions. [2018-04-12 18:21:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 18:21:01,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:01,034 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:01,034 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash -496321924, now seen corresponding path program 1 times [2018-04-12 18:21:01,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:01,034 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:01,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:01,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:01,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:01,042 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:21:01,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:21:01,103 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-12 18:21:01,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:01,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:21:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:21:01,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:21:01,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-04-12 18:21:01,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 18:21:01,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 18:21:01,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2018-04-12 18:21:01,365 INFO L87 Difference]: Start difference. First operand 310 states and 350 transitions. Second operand 8 states. [2018-04-12 18:21:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:01,498 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2018-04-12 18:21:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:21:01,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-04-12 18:21:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:01,499 INFO L225 Difference]: With dead ends: 351 [2018-04-12 18:21:01,499 INFO L226 Difference]: Without dead ends: 319 [2018-04-12 18:21:01,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=72, Unknown=4, NotChecked=0, Total=110 [2018-04-12 18:21:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-12 18:21:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2018-04-12 18:21:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-12 18:21:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 358 transitions. [2018-04-12 18:21:01,503 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 358 transitions. Word has length 58 [2018-04-12 18:21:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:01,504 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 358 transitions. [2018-04-12 18:21:01,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 18:21:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 358 transitions. [2018-04-12 18:21:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 18:21:01,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:01,505 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:01,505 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1981068824, now seen corresponding path program 1 times [2018-04-12 18:21:01,505 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:01,505 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:01,506 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:01,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:01,506 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:01,517 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:21:01,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:01,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-12 18:21:01,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 18:21:01,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 18:21:01,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-04-12 18:21:01,639 INFO L87 Difference]: Start difference. First operand 318 states and 358 transitions. Second operand 14 states. [2018-04-12 18:21:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:02,534 INFO L93 Difference]: Finished difference Result 794 states and 869 transitions. [2018-04-12 18:21:02,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 18:21:02,534 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-12 18:21:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:02,536 INFO L225 Difference]: With dead ends: 794 [2018-04-12 18:21:02,536 INFO L226 Difference]: Without dead ends: 794 [2018-04-12 18:21:02,536 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=1355, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 18:21:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-04-12 18:21:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 433. [2018-04-12 18:21:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-12 18:21:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 499 transitions. [2018-04-12 18:21:02,541 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 499 transitions. Word has length 62 [2018-04-12 18:21:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:02,541 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 499 transitions. [2018-04-12 18:21:02,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 18:21:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 499 transitions. [2018-04-12 18:21:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 18:21:02,542 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:02,542 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:02,542 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash -244403719, now seen corresponding path program 1 times [2018-04-12 18:21:02,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:02,542 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:02,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:02,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:02,548 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:21:02,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:02,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:21:02,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 18:21:02,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 18:21:02,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:21:02,586 INFO L87 Difference]: Start difference. First operand 433 states and 499 transitions. Second operand 7 states. [2018-04-12 18:21:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:02,735 INFO L93 Difference]: Finished difference Result 456 states and 517 transitions. [2018-04-12 18:21:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:21:02,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-04-12 18:21:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:02,736 INFO L225 Difference]: With dead ends: 456 [2018-04-12 18:21:02,736 INFO L226 Difference]: Without dead ends: 456 [2018-04-12 18:21:02,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:21:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-12 18:21:02,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 433. [2018-04-12 18:21:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-12 18:21:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 498 transitions. [2018-04-12 18:21:02,742 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 498 transitions. Word has length 63 [2018-04-12 18:21:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:02,742 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 498 transitions. [2018-04-12 18:21:02,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 18:21:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 498 transitions. [2018-04-12 18:21:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 18:21:02,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:02,743 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:02,743 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:02,743 INFO L82 PathProgramCache]: Analyzing trace with hash 935150629, now seen corresponding path program 1 times [2018-04-12 18:21:02,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:02,743 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:02,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:02,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:02,751 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:21:02,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:02,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:21:02,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 18:21:02,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 18:21:02,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 18:21:02,777 INFO L87 Difference]: Start difference. First operand 433 states and 498 transitions. Second operand 3 states. [2018-04-12 18:21:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:02,784 INFO L93 Difference]: Finished difference Result 701 states and 812 transitions. [2018-04-12 18:21:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 18:21:02,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-04-12 18:21:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:02,787 INFO L225 Difference]: With dead ends: 701 [2018-04-12 18:21:02,787 INFO L226 Difference]: Without dead ends: 701 [2018-04-12 18:21:02,787 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-12 18:21:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-12 18:21:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 525. [2018-04-12 18:21:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-12 18:21:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 615 transitions. [2018-04-12 18:21:02,794 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 615 transitions. Word has length 63 [2018-04-12 18:21:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:02,795 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 615 transitions. [2018-04-12 18:21:02,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 18:21:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 615 transitions. [2018-04-12 18:21:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 18:21:02,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:02,796 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:02,796 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:02,796 INFO L82 PathProgramCache]: Analyzing trace with hash 992408931, now seen corresponding path program 1 times [2018-04-12 18:21:02,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:02,796 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:02,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:02,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:02,803 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:21:02,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:02,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 18:21:02,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:21:02,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:21:02,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:21:02,846 INFO L87 Difference]: Start difference. First operand 525 states and 615 transitions. Second operand 6 states. [2018-04-12 18:21:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:02,927 INFO L93 Difference]: Finished difference Result 503 states and 578 transitions. [2018-04-12 18:21:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:21:02,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-04-12 18:21:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:02,929 INFO L225 Difference]: With dead ends: 503 [2018-04-12 18:21:02,929 INFO L226 Difference]: Without dead ends: 503 [2018-04-12 18:21:02,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:21:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-12 18:21:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 428. [2018-04-12 18:21:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-12 18:21:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 487 transitions. [2018-04-12 18:21:02,935 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 487 transitions. Word has length 63 [2018-04-12 18:21:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:02,935 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 487 transitions. [2018-04-12 18:21:02,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:21:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 487 transitions. [2018-04-12 18:21:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-12 18:21:02,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:02,936 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:02,936 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1545552034, now seen corresponding path program 1 times [2018-04-12 18:21:02,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:02,937 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:02,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:02,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:02,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-12 18:21:03,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:03,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 18:21:03,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 18:21:03,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 18:21:03,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:21:03,045 INFO L87 Difference]: Start difference. First operand 428 states and 487 transitions. Second operand 11 states. [2018-04-12 18:21:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:03,433 INFO L93 Difference]: Finished difference Result 694 states and 796 transitions. [2018-04-12 18:21:03,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 18:21:03,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-04-12 18:21:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:03,435 INFO L225 Difference]: With dead ends: 694 [2018-04-12 18:21:03,435 INFO L226 Difference]: Without dead ends: 694 [2018-04-12 18:21:03,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-04-12 18:21:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-12 18:21:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 398. [2018-04-12 18:21:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-12 18:21:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 455 transitions. [2018-04-12 18:21:03,439 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 455 transitions. Word has length 65 [2018-04-12 18:21:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:03,439 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 455 transitions. [2018-04-12 18:21:03,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 18:21:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 455 transitions. [2018-04-12 18:21:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-12 18:21:03,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:03,440 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:03,441 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1982567314, now seen corresponding path program 1 times [2018-04-12 18:21:03,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:03,441 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:03,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:03,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:03,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:03,449 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:21:03,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:03,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:21:03,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:21:03,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:21:03,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:21:03,492 INFO L87 Difference]: Start difference. First operand 398 states and 455 transitions. Second operand 5 states. [2018-04-12 18:21:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:03,568 INFO L93 Difference]: Finished difference Result 414 states and 471 transitions. [2018-04-12 18:21:03,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:21:03,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-04-12 18:21:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:03,569 INFO L225 Difference]: With dead ends: 414 [2018-04-12 18:21:03,569 INFO L226 Difference]: Without dead ends: 414 [2018-04-12 18:21:03,570 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-12 18:21:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-12 18:21:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 402. [2018-04-12 18:21:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-12 18:21:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 458 transitions. [2018-04-12 18:21:03,574 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 458 transitions. Word has length 65 [2018-04-12 18:21:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:03,574 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 458 transitions. [2018-04-12 18:21:03,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:21:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 458 transitions. [2018-04-12 18:21:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 18:21:03,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:03,575 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:03,575 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1390252947, now seen corresponding path program 1 times [2018-04-12 18:21:03,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:03,575 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:03,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:03,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:03,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:03,585 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:03,906 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-12 18:21:03,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:21:03,906 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-12 18:21:03,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:03,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:21:04,003 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-12 18:21:04,009 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-12 18:21:04,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,021 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-12 18:21:04,024 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-12 18:21:04,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-12 18:21:04,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,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, 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-12 18:21:04,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:35 [2018-04-12 18:21:04,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-12 18:21:04,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:21:04,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-12 18:21:04,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,181 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-12 18:21:04,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,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-12 18:21:04,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:39 [2018-04-12 18:21:04,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:21:04,266 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-12 18:21:04,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-12 18:21:04,283 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-12 18:21:04,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-12 18:21:04,328 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-12 18:21:04,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:04,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-12 18:21:04,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:04,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,371 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-12 18:21:04,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:81 [2018-04-12 18:21:04,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-04-12 18:21:04,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2018-04-12 18:21:04,451 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-12 18:21:04,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,458 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-12 18:21:04,459 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,462 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-12 18:21:04,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-12 18:21:04,471 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-12 18:21:04,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:04,476 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-12 18:21:04,476 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:04,483 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-12 18:21:04,484 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:99, output treesize:7 [2018-04-12 18:21:04,516 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-12 18:21:04,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:21:04,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2018-04-12 18:21:04,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 18:21:04,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 18:21:04,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-04-12 18:21:04,535 INFO L87 Difference]: Start difference. First operand 402 states and 458 transitions. Second operand 30 states. [2018-04-12 18:21:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:06,316 INFO L93 Difference]: Finished difference Result 742 states and 820 transitions. [2018-04-12 18:21:06,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 18:21:06,317 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-04-12 18:21:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:06,318 INFO L225 Difference]: With dead ends: 742 [2018-04-12 18:21:06,318 INFO L226 Difference]: Without dead ends: 742 [2018-04-12 18:21:06,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=817, Invalid=3214, Unknown=1, NotChecked=0, Total=4032 [2018-04-12 18:21:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-04-12 18:21:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 487. [2018-04-12 18:21:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-04-12 18:21:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 549 transitions. [2018-04-12 18:21:06,325 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 549 transitions. Word has length 67 [2018-04-12 18:21:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:06,326 INFO L459 AbstractCegarLoop]: Abstraction has 487 states and 549 transitions. [2018-04-12 18:21:06,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 18:21:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 549 transitions. [2018-04-12 18:21:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-12 18:21:06,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:06,326 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:06,326 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1559864763, now seen corresponding path program 1 times [2018-04-12 18:21:06,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:06,327 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:06,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:06,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:06,333 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:21:06,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:21:06,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 18:21:06,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 18:21:06,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 18:21:06,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-12 18:21:06,567 INFO L87 Difference]: Start difference. First operand 487 states and 549 transitions. Second operand 12 states. [2018-04-12 18:21:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:06,978 INFO L93 Difference]: Finished difference Result 513 states and 569 transitions. [2018-04-12 18:21:06,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 18:21:06,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-04-12 18:21:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:06,980 INFO L225 Difference]: With dead ends: 513 [2018-04-12 18:21:06,980 INFO L226 Difference]: Without dead ends: 513 [2018-04-12 18:21:06,980 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-04-12 18:21:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-04-12 18:21:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 497. [2018-04-12 18:21:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-12 18:21:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 559 transitions. [2018-04-12 18:21:06,984 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 559 transitions. Word has length 69 [2018-04-12 18:21:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:06,984 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 559 transitions. [2018-04-12 18:21:06,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 18:21:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 559 transitions. [2018-04-12 18:21:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-12 18:21:06,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:06,985 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:06,985 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash -414101251, now seen corresponding path program 1 times [2018-04-12 18:21:06,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:06,985 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:06,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:06,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:06,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:06,991 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:07,065 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-12 18:21:07,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:21:07,065 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-12 18:21:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:07,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:21:07,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:07,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:07,103 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-12 18:21:07,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:21:07,124 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-12 18:21:07,126 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-12 18:21:07,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,133 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-12 18:21:07,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:21:07,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:07,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:21:07,208 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-12 18:21:07,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-12 18:21:07,251 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-12 18:21:07,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:07,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:07,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,266 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-12 18:21:07,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-04-12 18:21:07,332 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 49 treesize of output 31 [2018-04-12 18:21:07,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:07,337 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-12 18:21:07,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,344 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-12 18:21:07,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:07,352 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-12 18:21:07,352 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:15 [2018-04-12 18:21:07,416 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-12 18:21:07,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:21:07,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-12 18:21:07,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 18:21:07,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 18:21:07,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-04-12 18:21:07,449 INFO L87 Difference]: Start difference. First operand 497 states and 559 transitions. Second operand 22 states. [2018-04-12 18:21:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:08,185 INFO L93 Difference]: Finished difference Result 599 states and 646 transitions. [2018-04-12 18:21:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 18:21:08,185 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-12 18:21:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:08,187 INFO L225 Difference]: With dead ends: 599 [2018-04-12 18:21:08,187 INFO L226 Difference]: Without dead ends: 599 [2018-04-12 18:21:08,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:21:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-12 18:21:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-04-12 18:21:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-04-12 18:21:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 561 transitions. [2018-04-12 18:21:08,193 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 561 transitions. Word has length 69 [2018-04-12 18:21:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:08,193 INFO L459 AbstractCegarLoop]: Abstraction has 498 states and 561 transitions. [2018-04-12 18:21:08,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 18:21:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 561 transitions. [2018-04-12 18:21:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-12 18:21:08,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:08,194 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:08,194 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash -414101250, now seen corresponding path program 1 times [2018-04-12 18:21:08,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:08,195 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:08,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:08,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:08,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:08,204 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:08,336 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-12 18:21:08,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:21:08,337 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-12 18:21:08,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:08,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:21:08,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,402 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-12 18:21:08,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:21:08,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:21:08,423 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-12 18:21:08,425 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-12 18:21:08,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,436 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-12 18:21:08,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:21:08,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,446 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-12 18:21:08,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:21:08,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:21:08,503 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-12 18:21:08,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-12 18:21:08,521 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-12 18:21:08,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-04-12 18:21:08,572 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-12 18:21:08,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:08,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,607 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-12 18:21:08,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:08,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,626 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-12 18:21:08,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-04-12 18:21:08,682 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 73 treesize of output 51 [2018-04-12 18:21:08,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-04-12 18:21:08,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,695 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-12 18:21:08,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-12 18:21:08,708 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-12 18:21:08,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:08,713 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-12 18:21:08,713 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,715 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:08,717 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-12 18:21:08,717 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-12 18:21:08,754 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-12 18:21:08,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:21:08,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-04-12 18:21:08,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 18:21:08,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 18:21:08,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-12 18:21:08,774 INFO L87 Difference]: Start difference. First operand 498 states and 561 transitions. Second operand 18 states. [2018-04-12 18:21:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:09,552 INFO L93 Difference]: Finished difference Result 580 states and 627 transitions. [2018-04-12 18:21:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 18:21:09,552 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-04-12 18:21:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:09,553 INFO L225 Difference]: With dead ends: 580 [2018-04-12 18:21:09,553 INFO L226 Difference]: Without dead ends: 580 [2018-04-12 18:21:09,554 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=707, Unknown=3, NotChecked=0, Total=870 [2018-04-12 18:21:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-04-12 18:21:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 521. [2018-04-12 18:21:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-12 18:21:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 589 transitions. [2018-04-12 18:21:09,557 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 589 transitions. Word has length 69 [2018-04-12 18:21:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:09,557 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 589 transitions. [2018-04-12 18:21:09,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 18:21:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 589 transitions. [2018-04-12 18:21:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 18:21:09,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:09,558 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:09,558 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash -176123504, now seen corresponding path program 1 times [2018-04-12 18:21:09,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:09,558 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:09,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:09,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:09,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:09,573 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:09,840 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-12 18:21:09,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:21:09,841 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-12 18:21:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:09,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:21:09,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:09,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:09,891 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-12 18:21:09,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:09,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:09,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 18:21:09,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:21:09,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:21:09,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:09,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:09,919 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-12 18:21:09,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 18:21:09,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-12 18:21:09,946 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-12 18:21:09,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:09,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:09,953 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-12 18:21:09,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 18:21:10,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-12 18:21:10,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:21:10,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:10,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:10,024 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-12 18:21:10,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 18:21:16,059 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 18:21:16,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:16,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:16,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:16,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-12 18:21:16,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:21:16,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-12 18:21:16,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-12 18:21:16,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:16,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-12 18:21:16,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,169 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-12 18:21:16,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-12 18:21:16,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:16,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 100 [2018-04-12 18:21:16,290 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-12 18:21:16,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,310 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-12 18:21:16,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-12 18:21:16,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2018-04-12 18:21:16,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:16,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:16,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,389 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-12 18:21:16,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:100 [2018-04-12 18:21:16,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2018-04-12 18:21:16,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-04-12 18:21:16,723 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-12 18:21:16,733 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-12 18:21:16,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:16,742 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-12 18:21:16,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:16,748 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-12 18:21:16,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:21:16,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-04-12 18:21:16,899 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-12 18:21:16,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:21:16,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-04-12 18:21:16,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 18:21:16,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 18:21:16,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1122, Unknown=3, NotChecked=0, Total=1332 [2018-04-12 18:21:16,928 INFO L87 Difference]: Start difference. First operand 521 states and 589 transitions. Second operand 37 states. [2018-04-12 18:21:31,647 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 38 DAG size of output 33 [2018-04-12 18:21:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:40,367 INFO L93 Difference]: Finished difference Result 879 states and 973 transitions. [2018-04-12 18:21:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 18:21:40,368 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-04-12 18:21:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:40,369 INFO L225 Difference]: With dead ends: 879 [2018-04-12 18:21:40,369 INFO L226 Difference]: Without dead ends: 879 [2018-04-12 18:21:40,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=920, Invalid=3622, Unknown=14, NotChecked=0, Total=4556 [2018-04-12 18:21:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-04-12 18:21:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 521. [2018-04-12 18:21:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-12 18:21:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 588 transitions. [2018-04-12 18:21:40,375 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 588 transitions. Word has length 72 [2018-04-12 18:21:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:40,375 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 588 transitions. [2018-04-12 18:21:40,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 18:21:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 588 transitions. [2018-04-12 18:21:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 18:21:40,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:40,376 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:40,376 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash -176123503, now seen corresponding path program 1 times [2018-04-12 18:21:40,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:40,377 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:40,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:40,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:40,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:40,392 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:41,002 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-12 18:21:41,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:21:41,003 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-12 18:21:41,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:41,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:21:41,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:41,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:41,055 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-12 18:21:41,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:21:41,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:21:41,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:21:41,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:21:41,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:21:41,110 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-12 18:21:41,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,119 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-12 18:21:41,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:53 [2018-04-12 18:21:41,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-12 18:21:41,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:21:41,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,193 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 69 treesize of output 63 [2018-04-12 18:21:41,194 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-12 18:21:41,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,207 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-12 18:21:41,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-04-12 18:21:41,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-12 18:21:41,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:21:41,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,304 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 99 treesize of output 85 [2018-04-12 18:21:41,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:21:41,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:41,330 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-12 18:21:41,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:109 [2018-04-12 18:21:45,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,435 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 22 treesize of output 25 [2018-04-12 18:21:45,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,450 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 18 treesize of output 27 [2018-04-12 18:21:45,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,462 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-12 18:21:45,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-04-12 18:21:45,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-04-12 18:21:45,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,512 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-12 18:21:45,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-04-12 18:21:45,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-04-12 18:21:45,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,565 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-12 18:21:45,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:104 [2018-04-12 18:21:45,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-04-12 18:21:45,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:21:45,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 126 [2018-04-12 18:21:45,735 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-12 18:21:45,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,763 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-12 18:21:45,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:119 [2018-04-12 18:21:45,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 140 [2018-04-12 18:21:45,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:45,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 76 [2018-04-12 18:21:45,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:45,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:21:45,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:45,901 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-12 18:21:45,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:162, output treesize:146 [2018-04-12 18:21:46,062 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 140 treesize of output 105 [2018-04-12 18:21:46,063 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-12 18:21:46,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:46,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:46,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, 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-12 18:21:46,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:46,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 54 [2018-04-12 18:21:46,116 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-12 18:21:46,126 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-12 18:21:46,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-04-12 18:21:46,142 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-12 18:21:46,142 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:46,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:46,149 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-12 18:21:46,150 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:46,154 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-12 18:21:46,154 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:46,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:46,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:21:46,162 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:164, output treesize:18 [2018-04-12 18:21:46,260 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-12 18:21:46,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:21:46,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-12 18:21:46,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 18:21:46,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 18:21:46,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1428, Unknown=2, NotChecked=0, Total=1640 [2018-04-12 18:21:46,279 INFO L87 Difference]: Start difference. First operand 521 states and 588 transitions. Second operand 41 states. [2018-04-12 18:21:48,847 WARN L151 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 74 DAG size of output 52 [2018-04-12 18:21:50,936 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 164 DAG size of output 84 [2018-04-12 18:21:51,109 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 164 DAG size of output 84 [2018-04-12 18:21:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:21:52,916 INFO L93 Difference]: Finished difference Result 1073 states and 1185 transitions. [2018-04-12 18:21:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-12 18:21:52,916 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 72 [2018-04-12 18:21:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:21:52,918 INFO L225 Difference]: With dead ends: 1073 [2018-04-12 18:21:52,918 INFO L226 Difference]: Without dead ends: 1073 [2018-04-12 18:21:52,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1402, Invalid=6078, Unknown=2, NotChecked=0, Total=7482 [2018-04-12 18:21:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-04-12 18:21:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 521. [2018-04-12 18:21:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-12 18:21:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 585 transitions. [2018-04-12 18:21:52,924 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 585 transitions. Word has length 72 [2018-04-12 18:21:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:21:52,924 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 585 transitions. [2018-04-12 18:21:52,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 18:21:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 585 transitions. [2018-04-12 18:21:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-12 18:21:52,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:21:52,925 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:21:52,925 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:21:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash -556281749, now seen corresponding path program 1 times [2018-04-12 18:21:52,925 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:21:52,925 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:21:52,926 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:52,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:52,926 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:21:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:52,937 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:21:53,176 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-12 18:21:53,176 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:21:53,176 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-12 18:21:53,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:21:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:21:53,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:21:53,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,204 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-12 18:21:53,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:21:53,227 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-12 18:21:53,229 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-12 18:21:53,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,234 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-12 18:21:53,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:21:53,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:21:53,300 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-12 18:21:53,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-12 18:21:53,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,334 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-12 18:21:53,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:35 [2018-04-12 18:21:53,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,364 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 44 treesize of output 43 [2018-04-12 18:21:53,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:21:53,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,381 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-12 18:21:53,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:52 [2018-04-12 18:21:53,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:53,440 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 70 treesize of output 78 [2018-04-12 18:21:53,441 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-12 18:21:53,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,468 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-12 18:21:53,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:61 [2018-04-12 18:21:53,550 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 111 treesize of output 80 [2018-04-12 18:21:53,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-12 18:21:53,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:53,569 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-12 18:21:53,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:97 [2018-04-12 18:21:57,659 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 104 treesize of output 61 [2018-04-12 18:21:57,661 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-12 18:21:57,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:57,669 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-12 18:21:57,670 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:57,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:21:57,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-12 18:21:57,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:21:57,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:57,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:21:57,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:104, output treesize:5 [2018-04-12 18:21:57,696 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-12 18:21:57,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:21:57,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2018-04-12 18:21:57,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 18:21:57,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 18:21:57,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=903, Unknown=2, NotChecked=0, Total=1056 [2018-04-12 18:21:57,715 INFO L87 Difference]: Start difference. First operand 521 states and 585 transitions. Second operand 33 states. [2018-04-12 18:22:16,697 WARN L151 SmtUtils]: Spent 4086ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-04-12 18:22:26,790 WARN L151 SmtUtils]: Spent 4055ms on a formula simplification. DAG size of input: 77 DAG size of output 63 [2018-04-12 18:22:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:22:40,061 INFO L93 Difference]: Finished difference Result 727 states and 792 transitions. [2018-04-12 18:22:40,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 18:22:40,061 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-04-12 18:22:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:22:40,063 INFO L225 Difference]: With dead ends: 727 [2018-04-12 18:22:40,063 INFO L226 Difference]: Without dead ends: 727 [2018-04-12 18:22:40,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=669, Invalid=2622, Unknown=15, NotChecked=0, Total=3306 [2018-04-12 18:22:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-04-12 18:22:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 582. [2018-04-12 18:22:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-04-12 18:22:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 656 transitions. [2018-04-12 18:22:40,067 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 656 transitions. Word has length 74 [2018-04-12 18:22:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:22:40,067 INFO L459 AbstractCegarLoop]: Abstraction has 582 states and 656 transitions. [2018-04-12 18:22:40,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 18:22:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 656 transitions. [2018-04-12 18:22:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-12 18:22:40,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:22:40,068 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:22:40,068 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:22:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash -556281748, now seen corresponding path program 1 times [2018-04-12 18:22:40,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:22:40,068 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:22:40,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:22:40,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:22:40,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:22:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:22:40,076 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:22:40,480 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-12 18:22:40,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:22:40,498 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-12 18:22:40,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:22:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:22:40,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:22:40,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,549 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-12 18:22:40,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 18:22:40,576 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-12 18:22:40,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:22:40,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,585 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-12 18:22:40,587 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-12 18:22:40,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,593 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-12 18:22:40,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 18:22:40,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:22:40,667 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-12 18:22:40,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-12 18:22:40,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, 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-12 18:22:40,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-12 18:22:40,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,732 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-12 18:22:40,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2018-04-12 18:22:40,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,769 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 55 treesize of output 54 [2018-04-12 18:22:40,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:22:40,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,800 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 32 treesize of output 38 [2018-04-12 18:22:40,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:22:40,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,819 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-12 18:22:40,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:75 [2018-04-12 18:22:40,890 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 42 treesize of output 65 [2018-04-12 18:22:40,892 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-12 18:22:40,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:40,918 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 94 treesize of output 102 [2018-04-12 18:22:40,920 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-12 18:22:40,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:40,942 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-12 18:22:40,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:97 [2018-04-12 18:22:41,043 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 174 treesize of output 131 [2018-04-12 18:22:41,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-12 18:22:41,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:41,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:41,082 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 69 treesize of output 84 [2018-04-12 18:22:41,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-12 18:22:41,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:41,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:41,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:22:41,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:156 [2018-04-12 18:22:45,222 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 96 [2018-04-12 18:22:45,225 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 40 treesize of output 27 [2018-04-12 18:22:45,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:45,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:22:45,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-04-12 18:22:45,239 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-12 18:22:45,252 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-12 18:22:45,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:45,259 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-12 18:22:45,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2018-04-12 18:22:45,285 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-12 18:22:45,285 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:45,292 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-12 18:22:45,292 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:45,295 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-12 18:22:45,295 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:22:45,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:45,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:22:45,302 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:170, output treesize:9 [2018-04-12 18:22:45,370 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-12 18:22:45,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:22:45,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2018-04-12 18:22:45,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 18:22:45,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 18:22:45,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1209, Unknown=2, NotChecked=0, Total=1332 [2018-04-12 18:22:45,389 INFO L87 Difference]: Start difference. First operand 582 states and 656 transitions. Second operand 37 states. [2018-04-12 18:23:04,613 WARN L151 SmtUtils]: Spent 4064ms on a formula simplification. DAG size of input: 109 DAG size of output 76 [2018-04-12 18:23:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:23:30,452 INFO L93 Difference]: Finished difference Result 766 states and 825 transitions. [2018-04-12 18:23:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 18:23:30,452 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-04-12 18:23:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:23:30,453 INFO L225 Difference]: With dead ends: 766 [2018-04-12 18:23:30,453 INFO L226 Difference]: Without dead ends: 766 [2018-04-12 18:23:30,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=810, Invalid=4002, Unknown=18, NotChecked=0, Total=4830 [2018-04-12 18:23:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-12 18:23:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 605. [2018-04-12 18:23:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-12 18:23:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2018-04-12 18:23:30,458 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 74 [2018-04-12 18:23:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:23:30,458 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2018-04-12 18:23:30,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 18:23:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2018-04-12 18:23:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-12 18:23:30,459 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:23:30,459 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:23:30,459 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:23:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash -286750696, now seen corresponding path program 1 times [2018-04-12 18:23:30,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:23:30,460 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:23:30,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:23:30,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:23:30,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:23:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:23:30,482 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:23:31,159 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-12 18:23:31,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:23:31,159 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-12 18:23:31,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:23:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:23:31,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:23:31,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:31,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:31,215 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-12 18:23:31,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 18:23:31,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:23:31,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:23:31,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,252 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-12 18:23:31,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 18:23:31,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 45 treesize of output 39 [2018-04-12 18:23:31,307 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-12 18:23:31,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,319 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-12 18:23:31,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 18:23:31,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-12 18:23:31,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:23:31,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:31,430 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-12 18:23:31,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 18:23:37,473 WARN L151 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 18:23:37,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-12 18:23:37,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:23:37,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-12 18:23:37,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-12 18:23:37,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-12 18:23:37,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,594 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-12 18:23:37,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-12 18:23:37,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 100 [2018-04-12 18:23:37,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 8 treesize of output 7 [2018-04-12 18:23:37,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,762 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-12 18:23:37,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-12 18:23:37,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-04-12 18:23:37,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:23:37,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:113 [2018-04-12 18:23:37,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2018-04-12 18:23:37,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:37,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12 18:23:37,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:37,944 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-12 18:23:37,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:137 [2018-04-12 18:23:38,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:38,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 163 [2018-04-12 18:23:38,091 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-12 18:23:38,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:38,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:38,123 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-12 18:23:38,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:150 [2018-04-12 18:23:38,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 160 [2018-04-12 18:23:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-12 18:23:38,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:38,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:23:38,331 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-12 18:23:38,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:204, output treesize:190 [2018-04-12 18:23:42,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 113 [2018-04-12 18:23:42,588 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-12 18:23:42,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:42,600 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-12 18:23:42,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:23:42,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:23:42,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-04-12 18:23:42,611 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-12 18:23:42,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2018-04-12 18:23:42,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:23:42,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:23:42,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:23:42,637 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:184, output treesize:45 [2018-04-12 18:23:42,771 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-12 18:23:42,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:23:42,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 54 [2018-04-12 18:23:42,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 18:23:42,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 18:23:42,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=2513, Unknown=6, NotChecked=0, Total=2970 [2018-04-12 18:23:42,790 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand 55 states. [2018-04-12 18:23:59,446 WARN L151 SmtUtils]: Spent 2038ms on a formula simplification. DAG size of input: 52 DAG size of output 40 [2018-04-12 18:24:07,730 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 104 DAG size of output 77 [2018-04-12 18:24:09,959 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 109 DAG size of output 82 [2018-04-12 18:24:12,130 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 103 DAG size of output 80 [2018-04-12 18:24:16,366 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 136 DAG size of output 101 [2018-04-12 18:24:18,638 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 141 DAG size of output 106 [2018-04-12 18:24:28,869 WARN L151 SmtUtils]: Spent 4142ms on a formula simplification. DAG size of input: 126 DAG size of output 101 [2018-04-12 18:24:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:24:38,531 INFO L93 Difference]: Finished difference Result 1288 states and 1427 transitions. [2018-04-12 18:24:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-12 18:24:38,531 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 77 [2018-04-12 18:24:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:24:38,533 INFO L225 Difference]: With dead ends: 1288 [2018-04-12 18:24:38,533 INFO L226 Difference]: Without dead ends: 1288 [2018-04-12 18:24:38,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3468 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=2641, Invalid=9988, Unknown=27, NotChecked=0, Total=12656 [2018-04-12 18:24:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2018-04-12 18:24:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 605. [2018-04-12 18:24:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-12 18:24:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 683 transitions. [2018-04-12 18:24:38,542 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 683 transitions. Word has length 77 [2018-04-12 18:24:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:24:38,542 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 683 transitions. [2018-04-12 18:24:38,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 18:24:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 683 transitions. [2018-04-12 18:24:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-12 18:24:38,542 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:24:38,542 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:24:38,543 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:24:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash -286750695, now seen corresponding path program 1 times [2018-04-12 18:24:38,543 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:24:38,543 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:24:38,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:24:38,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:24:38,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:24:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:24:38,565 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:24:39,493 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-12 18:24:39,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:24:39,494 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-12 18:24:39,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:24:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:24:39,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:24:39,562 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-12 18:24:39,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:39,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:39,569 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-12 18:24:39,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:24:39,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:24:39,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:24:39,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:24:39,618 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-12 18:24:39,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,626 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-12 18:24:39,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:53 [2018-04-12 18:24:39,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-12 18:24:39,694 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-12 18:24:39,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,709 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 69 treesize of output 63 [2018-04-12 18:24:39,710 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-12 18:24:39,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,724 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-12 18:24:39,724 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-04-12 18:24:39,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-12 18:24:39,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:24:39,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,839 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 99 treesize of output 85 [2018-04-12 18:24:39,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:24:39,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:39,868 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-12 18:24:39,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:109 [2018-04-12 18:24:43,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:43,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-12 18:24:43,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-12 18:24:44,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,025 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-12 18:24:44,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:113 [2018-04-12 18:24:44,085 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 84 treesize of output 83 [2018-04-12 18:24:44,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 96 [2018-04-12 18:24:44,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-04-12 18:24:44,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,126 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-12 18:24:44,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,150 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-12 18:24:44,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:135, output treesize:129 [2018-04-12 18:24:44,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,334 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 121 treesize of output 135 [2018-04-12 18:24:44,335 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-12 18:24:44,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-04-12 18:24:44,376 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-12 18:24:44,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,400 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-12 18:24:44,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:152, output treesize:144 [2018-04-12 18:24:44,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-12 18:24:44,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-04-12 18:24:44,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,559 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-12 18:24:44,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:146 [2018-04-12 18:24:44,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 83 [2018-04-12 18:24:44,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:24:44,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 150 [2018-04-12 18:24:44,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12 18:24:44,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,744 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-12 18:24:44,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:172, output treesize:170 [2018-04-12 18:24:44,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 122 [2018-04-12 18:24:44,908 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-12 18:24:44,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:44,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 202 [2018-04-12 18:24:44,954 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-12 18:24:44,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:44,996 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-12 18:24:44,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:216, output treesize:196 [2018-04-12 18:24:45,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 145 [2018-04-12 18:24:45,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-12 18:24:45,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:45,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:45,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 214 [2018-04-12 18:24:45,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-12 18:24:45,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:45,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:45,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 18:24:45,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:287, output treesize:259 [2018-04-12 18:24:49,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 169 [2018-04-12 18:24:49,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:24:49,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-04-12 18:24:49,526 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-12 18:24:49,551 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-12 18:24:49,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:49,568 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-12 18:24:49,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:49,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 53 [2018-04-12 18:24:49,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:24:49,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:24:49,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-04-12 18:24:49,626 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-12 18:24:49,627 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:49,636 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-12 18:24:49,636 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:49,642 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-12 18:24:49,643 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:49,647 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-12 18:24:49,647 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:24:49,648 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:24:49,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:24:49,659 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:277, output treesize:31 [2018-04-12 18:24:49,801 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-12 18:24:49,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:24:49,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 52 [2018-04-12 18:24:49,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-12 18:24:49,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-12 18:24:49,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2457, Unknown=4, NotChecked=0, Total=2756 [2018-04-12 18:24:49,819 INFO L87 Difference]: Start difference. First operand 605 states and 683 transitions. Second operand 53 states. [2018-04-12 18:24:52,393 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 93 DAG size of output 79 [2018-04-12 18:24:52,691 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 108 DAG size of output 92 [2018-04-12 18:24:52,949 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 114 DAG size of output 94 [2018-04-12 18:24:57,312 WARN L151 SmtUtils]: Spent 4200ms on a formula simplification. DAG size of input: 151 DAG size of output 129 [2018-04-12 18:25:01,618 WARN L151 SmtUtils]: Spent 4262ms on a formula simplification. DAG size of input: 145 DAG size of output 127 [2018-04-12 18:25:05,933 WARN L151 SmtUtils]: Spent 4196ms on a formula simplification. DAG size of input: 149 DAG size of output 131 [2018-04-12 18:25:06,792 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 187 DAG size of output 98 [2018-04-12 18:25:07,833 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 206 DAG size of output 103 [2018-04-12 18:25:08,163 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 206 DAG size of output 103 [2018-04-12 18:25:09,857 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 194 DAG size of output 105 [2018-04-12 18:25:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:25:11,558 INFO L93 Difference]: Finished difference Result 1270 states and 1398 transitions. [2018-04-12 18:25:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-12 18:25:11,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 77 [2018-04-12 18:25:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:25:11,560 INFO L225 Difference]: With dead ends: 1270 [2018-04-12 18:25:11,560 INFO L226 Difference]: Without dead ends: 1270 [2018-04-12 18:25:11,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4150 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=2587, Invalid=12661, Unknown=4, NotChecked=0, Total=15252 [2018-04-12 18:25:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-04-12 18:25:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 653. [2018-04-12 18:25:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-04-12 18:25:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 733 transitions. [2018-04-12 18:25:11,572 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 733 transitions. Word has length 77 [2018-04-12 18:25:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:25:11,572 INFO L459 AbstractCegarLoop]: Abstraction has 653 states and 733 transitions. [2018-04-12 18:25:11,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-12 18:25:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 733 transitions. [2018-04-12 18:25:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-12 18:25:11,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:25:11,573 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:25:11,573 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:25:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 928812249, now seen corresponding path program 1 times [2018-04-12 18:25:11,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:25:11,573 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:25:11,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:11,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:11,584 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:25:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:25:11,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:25:11,913 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-12 18:25:11,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:11,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:25:12,024 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-12 18:25:12,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 18:25:12,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:25:12,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:25:12,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:25:12,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-12 18:25:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:25:12,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:25:12,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-04-12 18:25:12,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 18:25:12,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 18:25:12,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-04-12 18:25:12,137 INFO L87 Difference]: Start difference. First operand 653 states and 733 transitions. Second operand 28 states. [2018-04-12 18:25:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:25:16,340 INFO L93 Difference]: Finished difference Result 935 states and 1043 transitions. [2018-04-12 18:25:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-12 18:25:16,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 78 [2018-04-12 18:25:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:25:16,342 INFO L225 Difference]: With dead ends: 935 [2018-04-12 18:25:16,342 INFO L226 Difference]: Without dead ends: 838 [2018-04-12 18:25:16,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=917, Invalid=5725, Unknown=0, NotChecked=0, Total=6642 [2018-04-12 18:25:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-04-12 18:25:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 777. [2018-04-12 18:25:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-04-12 18:25:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 899 transitions. [2018-04-12 18:25:16,348 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 899 transitions. Word has length 78 [2018-04-12 18:25:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:25:16,348 INFO L459 AbstractCegarLoop]: Abstraction has 777 states and 899 transitions. [2018-04-12 18:25:16,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 18:25:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 899 transitions. [2018-04-12 18:25:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-12 18:25:16,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:25:16,349 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:25:16,349 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:25:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1459761405, now seen corresponding path program 1 times [2018-04-12 18:25:16,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:25:16,349 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:25:16,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:16,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:16,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:16,355 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:25:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:25:16,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:25:16,467 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-12 18:25:16,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:16,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:25:16,607 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-12 18:25:16,608 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:16,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 18:25:16,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:16,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:16,617 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-12 18:25:16,618 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:16,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 18:25:16,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:16,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:16,625 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-12 18:25:16,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2018-04-12 18:25:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:25:16,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:25:16,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-04-12 18:25:16,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 18:25:16,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 18:25:16,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-04-12 18:25:16,672 INFO L87 Difference]: Start difference. First operand 777 states and 899 transitions. Second operand 22 states. [2018-04-12 18:25:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:25:18,587 INFO L93 Difference]: Finished difference Result 843 states and 911 transitions. [2018-04-12 18:25:18,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-12 18:25:18,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2018-04-12 18:25:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:25:18,589 INFO L225 Difference]: With dead ends: 843 [2018-04-12 18:25:18,589 INFO L226 Difference]: Without dead ends: 843 [2018-04-12 18:25:18,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1000, Invalid=4112, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 18:25:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-04-12 18:25:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 671. [2018-04-12 18:25:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-04-12 18:25:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 762 transitions. [2018-04-12 18:25:18,595 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 762 transitions. Word has length 78 [2018-04-12 18:25:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:25:18,595 INFO L459 AbstractCegarLoop]: Abstraction has 671 states and 762 transitions. [2018-04-12 18:25:18,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 18:25:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 762 transitions. [2018-04-12 18:25:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-12 18:25:18,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:25:18,596 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:25:18,596 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:25:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1686343903, now seen corresponding path program 1 times [2018-04-12 18:25:18,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:25:18,596 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:25:18,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:18,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:18,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:18,603 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:25:19,036 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-12 18:25:19,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:25:19,036 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-12 18:25:19,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:19,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:25:19,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,089 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-12 18:25:19,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 18:25:19,109 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-12 18:25:19,110 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-12 18:25:19,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,117 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-12 18:25:19,118 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-12 18:25:19,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,128 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-12 18:25:19,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-12 18:25:19,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 18:25:19,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 18:25:19,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,203 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 37 treesize of output 42 [2018-04-12 18:25:19,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:25:19,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:56 [2018-04-12 18:25:19,240 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 89 treesize of output 79 [2018-04-12 18:25:19,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,242 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 28 treesize of output 47 [2018-04-12 18:25:19,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,259 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 80 treesize of output 75 [2018-04-12 18:25:19,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,261 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 28 treesize of output 47 [2018-04-12 18:25:19,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:80 [2018-04-12 18:25:19,387 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 107 treesize of output 86 [2018-04-12 18:25:19,388 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 50 treesize of output 42 [2018-04-12 18:25:19,389 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-12 18:25:19,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,397 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 32 treesize of output 29 [2018-04-12 18:25:19,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,402 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-12 18:25:19,408 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 52 treesize of output 40 [2018-04-12 18:25:19,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:19,410 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 26 treesize of output 21 [2018-04-12 18:25:19,410 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,414 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 16 treesize of output 7 [2018-04-12 18:25:19,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:19,419 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-12 18:25:19,419 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:7 [2018-04-12 18:25:19,452 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-12 18:25:19,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:25:19,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 32 [2018-04-12 18:25:19,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 18:25:19,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 18:25:19,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=900, Unknown=1, NotChecked=0, Total=992 [2018-04-12 18:25:19,469 INFO L87 Difference]: Start difference. First operand 671 states and 762 transitions. Second operand 32 states. [2018-04-12 18:25:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:25:21,108 INFO L93 Difference]: Finished difference Result 737 states and 813 transitions. [2018-04-12 18:25:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 18:25:21,109 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 78 [2018-04-12 18:25:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:25:21,110 INFO L225 Difference]: With dead ends: 737 [2018-04-12 18:25:21,110 INFO L226 Difference]: Without dead ends: 737 [2018-04-12 18:25:21,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=469, Invalid=2722, Unknown=1, NotChecked=0, Total=3192 [2018-04-12 18:25:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-04-12 18:25:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 657. [2018-04-12 18:25:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-04-12 18:25:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 742 transitions. [2018-04-12 18:25:21,115 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 742 transitions. Word has length 78 [2018-04-12 18:25:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:25:21,115 INFO L459 AbstractCegarLoop]: Abstraction has 657 states and 742 transitions. [2018-04-12 18:25:21,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 18:25:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 742 transitions. [2018-04-12 18:25:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-12 18:25:21,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:25:21,116 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:25:21,116 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:25:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1489668431, now seen corresponding path program 2 times [2018-04-12 18:25:21,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:25:21,116 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:25:21,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:21,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:21,123 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:25:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:25:21,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:25:21,339 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-12 18:25:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:25:21,364 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:25:21,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:25:21,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:25:21,419 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-12 18:25:21,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:25:21,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-12 18:25:21,451 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-12 18:25:21,452 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-12 18:25:21,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,463 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-12 18:25:21,464 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-12 18:25:21,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,472 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-12 18:25:21,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:30 [2018-04-12 18:25:21,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:25:21,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:25:21,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-04-12 18:25:21,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 18:25:21,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:63, output treesize:67 [2018-04-12 18:25:21,607 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 88 treesize of output 83 [2018-04-12 18:25:21,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,640 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 28 treesize of output 47 [2018-04-12 18:25:21,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,663 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-12 18:25:21,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,665 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 28 treesize of output 47 [2018-04-12 18:25:21,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:95 [2018-04-12 18:25:21,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:21,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-04-12 18:25:21,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:25:21,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:122, output treesize:106 [2018-04-12 18:25:21,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,886 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:21,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-04-12 18:25:21,889 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:21,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2018-04-12 18:25:21,890 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-12 18:25:21,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:21,901 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 30 treesize of output 43 [2018-04-12 18:25:21,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,910 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-12 18:25:21,922 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 50 treesize of output 38 [2018-04-12 18:25:21,924 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:21,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:21,925 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 24 treesize of output 21 [2018-04-12 18:25:21,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:25:21,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-12 18:25:21,937 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:21,947 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-12 18:25:21,947 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:126, output treesize:7 [2018-04-12 18:25:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 8 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:25:22,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:25:22,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2018-04-12 18:25:22,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 18:25:22,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 18:25:22,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=772, Unknown=8, NotChecked=0, Total=870 [2018-04-12 18:25:22,007 INFO L87 Difference]: Start difference. First operand 657 states and 742 transitions. Second operand 30 states. [2018-04-12 18:25:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:25:24,200 INFO L93 Difference]: Finished difference Result 678 states and 741 transitions. [2018-04-12 18:25:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 18:25:24,200 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2018-04-12 18:25:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:25:24,202 INFO L225 Difference]: With dead ends: 678 [2018-04-12 18:25:24,202 INFO L226 Difference]: Without dead ends: 678 [2018-04-12 18:25:24,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=410, Invalid=2437, Unknown=15, NotChecked=0, Total=2862 [2018-04-12 18:25:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-04-12 18:25:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 642. [2018-04-12 18:25:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-04-12 18:25:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 717 transitions. [2018-04-12 18:25:24,205 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 717 transitions. Word has length 80 [2018-04-12 18:25:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:25:24,206 INFO L459 AbstractCegarLoop]: Abstraction has 642 states and 717 transitions. [2018-04-12 18:25:24,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 18:25:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 717 transitions. [2018-04-12 18:25:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-12 18:25:24,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:25:24,206 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:25:24,206 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:25:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash 560163699, now seen corresponding path program 1 times [2018-04-12 18:25:24,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:25:24,207 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:25:24,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:24,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:25:24,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:25:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:24,224 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:25:24,982 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-12 18:25:24,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:25:24,983 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-12 18:25:24,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:25:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:25:25,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:25:25,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,034 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-12 18:25:25,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 18:25:25,059 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-12 18:25:25,061 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-12 18:25:25,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,071 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-12 18:25:25,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:25:25,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,078 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-12 18:25:25,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 18:25:25,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:25:25,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 18:25:25,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,159 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 37 treesize of output 42 [2018-04-12 18:25:25,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:25:25,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:70 [2018-04-12 18:25:25,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,200 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-12 18:25:25,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-04-12 18:25:25,255 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 54 treesize of output 60 [2018-04-12 18:25:25,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,258 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-12 18:25:25,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,285 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 85 treesize of output 84 [2018-04-12 18:25:25,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,288 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 20 treesize of output 31 [2018-04-12 18:25:25,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,312 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-12 18:25:25,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:105 [2018-04-12 18:25:25,391 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 64 treesize of output 87 [2018-04-12 18:25:25,393 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-12 18:25:25,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:25:25,437 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 122 treesize of output 130 [2018-04-12 18:25:25,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:25:25,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,466 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-12 18:25:25,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:151, output treesize:131 [2018-04-12 18:25:25,591 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 221 treesize of output 199 [2018-04-12 18:25:25,594 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 30 treesize of output 45 [2018-04-12 18:25:25,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,634 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 213 treesize of output 162 [2018-04-12 18:25:25,637 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 30 treesize of output 45 [2018-04-12 18:25:25,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:25,667 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-12 18:25:25,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:243, output treesize:207 [2018-04-12 18:25:29,807 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 150 treesize of output 135 [2018-04-12 18:25:29,808 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 5 [2018-04-12 18:25:29,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:29,819 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 98 treesize of output 81 [2018-04-12 18:25:29,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:29,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:25:29,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:29,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:25:29,843 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-12 18:25:29,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:179, output treesize:110 [2018-04-12 18:25:31,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 57 [2018-04-12 18:25:31,955 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 32 treesize of output 16 [2018-04-12 18:25:31,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:31,961 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-12 18:25:31,962 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-12 18:25:31,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 7 treesize of output 1 [2018-04-12 18:25:31,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:25:31,971 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-12 18:25:31,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:25:31,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:28 [2018-04-12 18:25:32,069 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-12 18:25:32,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:25:32,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 41 [2018-04-12 18:25:32,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 18:25:32,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 18:25:32,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1561, Unknown=3, NotChecked=0, Total=1722 [2018-04-12 18:25:32,089 INFO L87 Difference]: Start difference. First operand 642 states and 717 transitions. Second operand 42 states. [2018-04-12 18:25:41,214 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 87 DAG size of output 65 [2018-04-12 18:25:57,520 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 112 DAG size of output 70 [2018-04-12 18:25:59,681 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 145 DAG size of output 88 [2018-04-12 18:26:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:26:20,942 INFO L93 Difference]: Finished difference Result 865 states and 947 transitions. [2018-04-12 18:26:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 18:26:20,942 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2018-04-12 18:26:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:26:20,943 INFO L225 Difference]: With dead ends: 865 [2018-04-12 18:26:20,943 INFO L226 Difference]: Without dead ends: 865 [2018-04-12 18:26:20,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=1050, Invalid=6241, Unknown=19, NotChecked=0, Total=7310 [2018-04-12 18:26:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-12 18:26:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 642. [2018-04-12 18:26:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-04-12 18:26:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 715 transitions. [2018-04-12 18:26:20,948 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 715 transitions. Word has length 83 [2018-04-12 18:26:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:26:20,949 INFO L459 AbstractCegarLoop]: Abstraction has 642 states and 715 transitions. [2018-04-12 18:26:20,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 18:26:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 715 transitions. [2018-04-12 18:26:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-12 18:26:20,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:26:20,949 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:26:20,949 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:26:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash 560163700, now seen corresponding path program 1 times [2018-04-12 18:26:20,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:26:20,949 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:26:20,950 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:26:20,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:26:20,950 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:26:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:26:20,963 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:26:21,676 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-12 18:26:21,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:26:21,677 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-12 18:26:21,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:26:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:26:21,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:26:21,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,729 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-12 18:26:21,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 18:26:21,755 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-12 18:26:21,756 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-12 18:26:21,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,764 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-12 18:26:21,765 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-12 18:26:21,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,772 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-12 18:26:21,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 18:26:21,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:26:21,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 18:26:21,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,860 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 37 treesize of output 42 [2018-04-12 18:26:21,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:26:21,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:70 [2018-04-12 18:26:21,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,903 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-12 18:26:21,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:26:21,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2018-04-12 18:26:21,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,957 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 63 treesize of output 62 [2018-04-12 18:26:21,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,961 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 20 treesize of output 31 [2018-04-12 18:26:21,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,986 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 54 treesize of output 60 [2018-04-12 18:26:21,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:21,988 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-12 18:26:21,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:21,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,006 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-12 18:26:22,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:104 [2018-04-12 18:26:22,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:22,079 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 136 treesize of output 144 [2018-04-12 18:26:22,081 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-12 18:26:22,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,114 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 77 treesize of output 100 [2018-04-12 18:26:22,115 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-12 18:26:22,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,137 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-12 18:26:22,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:150, output treesize:130 [2018-04-12 18:26:22,253 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 239 treesize of output 184 [2018-04-12 18:26:22,256 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 30 treesize of output 45 [2018-04-12 18:26:22,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,292 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 220 treesize of output 198 [2018-04-12 18:26:22,294 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 30 treesize of output 45 [2018-04-12 18:26:22,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:22,322 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-12 18:26:22,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:246, output treesize:210 [2018-04-12 18:26:28,606 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 195 treesize of output 138 [2018-04-12 18:26:28,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:26:28,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:28,628 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 64 treesize of output 54 [2018-04-12 18:26:28,628 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-12 18:26:28,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:28,641 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 75 treesize of output 44 [2018-04-12 18:26:28,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:28,650 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-12 18:26:28,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-04-12 18:26:28,662 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-12 18:26:28,663 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:28,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:28,674 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 26 treesize of output 21 [2018-04-12 18:26:28,674 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:28,678 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-12 18:26:28,678 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:28,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:28,682 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-12 18:26:28,683 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:202, output treesize:9 [2018-04-12 18:26:28,754 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-12 18:26:28,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:26:28,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 41 [2018-04-12 18:26:28,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 18:26:28,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 18:26:28,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1584, Unknown=3, NotChecked=0, Total=1722 [2018-04-12 18:26:28,773 INFO L87 Difference]: Start difference. First operand 642 states and 715 transitions. Second operand 42 states. [2018-04-12 18:26:29,919 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 155 DAG size of output 72 [2018-04-12 18:26:30,230 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 170 DAG size of output 73 [2018-04-12 18:26:31,519 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 124 DAG size of output 85 [2018-04-12 18:26:31,854 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 125 DAG size of output 111 [2018-04-12 18:26:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:26:34,017 INFO L93 Difference]: Finished difference Result 907 states and 988 transitions. [2018-04-12 18:26:34,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 18:26:34,017 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2018-04-12 18:26:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:26:34,019 INFO L225 Difference]: With dead ends: 907 [2018-04-12 18:26:34,019 INFO L226 Difference]: Without dead ends: 907 [2018-04-12 18:26:34,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=996, Invalid=6833, Unknown=3, NotChecked=0, Total=7832 [2018-04-12 18:26:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-04-12 18:26:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 642. [2018-04-12 18:26:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-04-12 18:26:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 709 transitions. [2018-04-12 18:26:34,024 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 709 transitions. Word has length 83 [2018-04-12 18:26:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:26:34,024 INFO L459 AbstractCegarLoop]: Abstraction has 642 states and 709 transitions. [2018-04-12 18:26:34,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 18:26:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 709 transitions. [2018-04-12 18:26:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-12 18:26:34,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:26:34,025 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:26:34,025 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:26:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1330554499, now seen corresponding path program 2 times [2018-04-12 18:26:34,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:26:34,025 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:26:34,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:26:34,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:26:34,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:26:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:26:34,033 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:26:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:26:34,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:26:34,452 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-12 18:26:34,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:26:34,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:26:34,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:26:34,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:26:34,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,542 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-12 18:26:34,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-12 18:26:34,574 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-12 18:26:34,576 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-12 18:26:34,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,586 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-12 18:26:34,587 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-12 18:26:34,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,596 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-12 18:26:34,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-12 18:26:34,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:26:34,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 18:26:34,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,731 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 37 treesize of output 42 [2018-04-12 18:26:34,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:26:34,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:76 [2018-04-12 18:26:34,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,783 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 18:26:34,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:78 [2018-04-12 18:26:34,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,830 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 63 treesize of output 62 [2018-04-12 18:26:34,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:26:34,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,858 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 54 treesize of output 60 [2018-04-12 18:26:34,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,860 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-12 18:26:34,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,879 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-12 18:26:34,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:96 [2018-04-12 18:26:34,958 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 87 [2018-04-12 18:26:34,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 14 treesize of output 13 [2018-04-12 18:26:34,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:34,987 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 112 treesize of output 120 [2018-04-12 18:26:34,989 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-12 18:26:34,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:34,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:35,012 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-12 18:26:35,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:142, output treesize:118 [2018-04-12 18:26:35,142 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 220 treesize of output 198 [2018-04-12 18:26:35,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-04-12 18:26:35,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:35,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:35,186 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 203 treesize of output 152 [2018-04-12 18:26:35,188 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 30 treesize of output 45 [2018-04-12 18:26:35,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:35,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:35,214 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-12 18:26:35,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:234, output treesize:198 [2018-04-12 18:26:39,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 134 [2018-04-12 18:26:39,459 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:26:39,476 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 104 treesize of output 88 [2018-04-12 18:26:39,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:39,487 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 3 [2018-04-12 18:26:39,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:39,496 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-12 18:26:39,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:39,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:39,514 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-12 18:26:39,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:176, output treesize:104 [2018-04-12 18:26:41,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:26:41,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:26:41,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 87 [2018-04-12 18:26:41,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:26:41,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:41,649 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:26:41,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-04-12 18:26:41,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:41,654 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 29 treesize of output 18 [2018-04-12 18:26:41,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:26:41,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:26:41,668 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-12 18:26:41,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:110, output treesize:8 [2018-04-12 18:26:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:26:41,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:26:41,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-04-12 18:26:41,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 18:26:41,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 18:26:41,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1608, Unknown=8, NotChecked=0, Total=1806 [2018-04-12 18:26:41,763 INFO L87 Difference]: Start difference. First operand 642 states and 709 transitions. Second operand 43 states. [2018-04-12 18:27:06,993 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 111 DAG size of output 71 [2018-04-12 18:27:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:27:35,865 INFO L93 Difference]: Finished difference Result 759 states and 820 transitions. [2018-04-12 18:27:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 18:27:35,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2018-04-12 18:27:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:27:35,868 INFO L225 Difference]: With dead ends: 759 [2018-04-12 18:27:35,868 INFO L226 Difference]: Without dead ends: 759 [2018-04-12 18:27:35,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=1085, Invalid=6535, Unknown=36, NotChecked=0, Total=7656 [2018-04-12 18:27:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-04-12 18:27:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 639. [2018-04-12 18:27:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-04-12 18:27:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 704 transitions. [2018-04-12 18:27:35,873 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 704 transitions. Word has length 85 [2018-04-12 18:27:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:27:35,873 INFO L459 AbstractCegarLoop]: Abstraction has 639 states and 704 transitions. [2018-04-12 18:27:35,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 18:27:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 704 transitions. [2018-04-12 18:27:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-12 18:27:35,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:27:35,874 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:27:35,874 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:27:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1873760940, now seen corresponding path program 1 times [2018-04-12 18:27:35,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:27:35,874 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:27:35,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:27:35,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:27:35,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:27:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:27:35,891 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:27:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:27:36,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:27:36,117 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-12 18:27:36,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:27:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:27:36,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:27:36,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 18:27:36,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-04-12 18:27:36,205 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-12 18:27:36,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:27:36,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,215 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-12 18:27:36,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-04-12 18:27:36,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,299 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 44 treesize of output 45 [2018-04-12 18:27:36,300 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-12 18:27:36,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-04-12 18:27:36,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,336 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 18:27:36,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:46 [2018-04-12 18:27:36,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,367 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 52 treesize of output 51 [2018-04-12 18:27:36,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:27:36,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,383 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-12 18:27:36,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:58 [2018-04-12 18:27:36,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:36,428 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 86 [2018-04-12 18:27:36,429 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-12 18:27:36,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,444 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-12 18:27:36,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:67 [2018-04-12 18:27:36,545 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 110 treesize of output 79 [2018-04-12 18:27:36,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-12 18:27:36,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:36,563 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-12 18:27:36,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:99 [2018-04-12 18:27:40,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 60 [2018-04-12 18:27:40,641 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-12 18:27:40,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:40,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:27:40,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-04-12 18:27:40,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:40,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-12 18:27:40,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:27:40,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:27:40,688 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-12 18:27:40,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:8 [2018-04-12 18:27:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:27:40,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:27:40,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2018-04-12 18:27:40,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 18:27:40,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 18:27:40,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=977, Unknown=2, NotChecked=0, Total=1122 [2018-04-12 18:27:40,792 INFO L87 Difference]: Start difference. First operand 639 states and 704 transitions. Second operand 34 states. [2018-04-12 18:27:57,307 WARN L148 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-12 18:28:05,360 WARN L148 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-12 18:28:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:28:30,350 INFO L93 Difference]: Finished difference Result 757 states and 811 transitions. [2018-04-12 18:28:30,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 18:28:30,350 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-04-12 18:28:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:28:30,351 INFO L225 Difference]: With dead ends: 757 [2018-04-12 18:28:30,352 INFO L226 Difference]: Without dead ends: 757 [2018-04-12 18:28:30,352 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=552, Invalid=3209, Unknown=21, NotChecked=0, Total=3782 [2018-04-12 18:28:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-12 18:28:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 673. [2018-04-12 18:28:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-04-12 18:28:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 742 transitions. [2018-04-12 18:28:30,356 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 742 transitions. Word has length 88 [2018-04-12 18:28:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:28:30,356 INFO L459 AbstractCegarLoop]: Abstraction has 673 states and 742 transitions. [2018-04-12 18:28:30,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 18:28:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 742 transitions. [2018-04-12 18:28:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-12 18:28:30,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:28:30,356 INFO L355 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:28:30,357 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:28:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1016269908, now seen corresponding path program 1 times [2018-04-12 18:28:30,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:28:30,357 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:28:30,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:30,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:28:30,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:28:30,364 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:28:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:28:30,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:28:30,590 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:28:30,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:28:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:28:30,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:28:30,633 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-12 18:28:30,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:30,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:30,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 18:28:30,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:30,677 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 29 treesize of output 32 [2018-04-12 18:28:30,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:30,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:30,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-12 18:28:30,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:30,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:30,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:30,696 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 28 treesize of output 22 [2018-04-12 18:28:30,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:30,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:30,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:30,697 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 28 treesize of output 22 [2018-04-12 18:28:30,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:30,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:30,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:45 [2018-04-12 18:28:31,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 60 [2018-04-12 18:28:31,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 18:28:31,138 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2018-04-12 18:28:31,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:28:31,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-12 18:28:31,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:89, output treesize:115 [2018-04-12 18:28:31,367 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-12 18:28:31,526 WARN L148 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-12 18:28:31,729 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 74 DAG size of output 59 [2018-04-12 18:28:31,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-04-12 18:28:31,741 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-12 18:28:31,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:31,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2018-04-12 18:28:31,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:31,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:31,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-04-12 18:28:31,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:28:31,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:31,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2018-04-12 18:28:31,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:31,826 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:31,875 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 47 [2018-04-12 18:28:31,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:31,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 42 [2018-04-12 18:28:31,886 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-12 18:28:31,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2018-04-12 18:28:31,940 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:31,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-04-12 18:28:31,985 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:31,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-04-12 18:28:31,986 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:32,018 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-12 18:28:32,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-12 18:28:32,087 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 9 variables, input treesize:143, output treesize:126 [2018-04-12 18:28:32,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:32,228 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 12 treesize of output 21 [2018-04-12 18:28:32,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:32,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:28:32,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-04-12 18:28:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:28:32,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:28:32,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2018-04-12 18:28:32,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 18:28:32,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 18:28:32,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 18:28:32,355 INFO L87 Difference]: Start difference. First operand 673 states and 742 transitions. Second operand 34 states. [2018-04-12 18:28:33,170 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 52 DAG size of output 40 [2018-04-12 18:28:35,282 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 90 DAG size of output 70 [2018-04-12 18:28:35,583 WARN L151 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 159 DAG size of output 66 [2018-04-12 18:28:35,853 WARN L151 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 109 DAG size of output 74 [2018-04-12 18:28:36,116 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 122 DAG size of output 93 [2018-04-12 18:28:36,332 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 93 DAG size of output 73 [2018-04-12 18:28:36,711 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 151 DAG size of output 94 [2018-04-12 18:28:37,072 WARN L151 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 122 DAG size of output 86 [2018-04-12 18:28:37,288 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 122 DAG size of output 66 [2018-04-12 18:28:38,218 WARN L151 SmtUtils]: Spent 449ms on a formula simplification. DAG size of input: 131 DAG size of output 104 [2018-04-12 18:28:38,443 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 104 DAG size of output 69 [2018-04-12 18:28:38,732 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 117 DAG size of output 88 [2018-04-12 18:28:39,292 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 106 DAG size of output 71 [2018-04-12 18:28:39,594 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 96 DAG size of output 76 [2018-04-12 18:28:39,800 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 96 DAG size of output 76 [2018-04-12 18:28:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:28:40,244 INFO L93 Difference]: Finished difference Result 909 states and 994 transitions. [2018-04-12 18:28:40,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-12 18:28:40,245 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2018-04-12 18:28:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:28:40,247 INFO L225 Difference]: With dead ends: 909 [2018-04-12 18:28:40,247 INFO L226 Difference]: Without dead ends: 909 [2018-04-12 18:28:40,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=891, Invalid=4809, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 18:28:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-04-12 18:28:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 753. [2018-04-12 18:28:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-04-12 18:28:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 845 transitions. [2018-04-12 18:28:40,255 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 845 transitions. Word has length 93 [2018-04-12 18:28:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:28:40,255 INFO L459 AbstractCegarLoop]: Abstraction has 753 states and 845 transitions. [2018-04-12 18:28:40,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 18:28:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 845 transitions. [2018-04-12 18:28:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-12 18:28:40,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:28:40,256 INFO L355 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:28:40,256 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:28:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1016269907, now seen corresponding path program 1 times [2018-04-12 18:28:40,256 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:28:40,256 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:28:40,257 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:28:40,257 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:28:40,265 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:28:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:28:40,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:28:40,363 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:28:40,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:28:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:28:40,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:28:40,507 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-12 18:28:40,511 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 19 treesize of output 20 [2018-04-12 18:28:40,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:40,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:28:40,525 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 26 treesize of output 20 [2018-04-12 18:28:40,529 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 20 treesize of output 19 [2018-04-12 18:28:40,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:28:40,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:28:40,535 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 30 treesize of output 24 [2018-04-12 18:28:40,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-12 18:28:40,537 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:40,539 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:40,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-12 18:28:40,548 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:43, output treesize:39 [2018-04-12 18:28:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:28:40,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:28:40,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-04-12 18:28:40,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 18:28:40,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 18:28:40,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=259, Unknown=5, NotChecked=0, Total=306 [2018-04-12 18:28:40,621 INFO L87 Difference]: Start difference. First operand 753 states and 845 transitions. Second operand 18 states. [2018-04-12 18:28:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:28:41,713 INFO L93 Difference]: Finished difference Result 809 states and 885 transitions. [2018-04-12 18:28:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 18:28:41,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-04-12 18:28:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:28:41,715 INFO L225 Difference]: With dead ends: 809 [2018-04-12 18:28:41,715 INFO L226 Difference]: Without dead ends: 809 [2018-04-12 18:28:41,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=667, Unknown=7, NotChecked=0, Total=812 [2018-04-12 18:28:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-04-12 18:28:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 778. [2018-04-12 18:28:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-04-12 18:28:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 877 transitions. [2018-04-12 18:28:41,722 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 877 transitions. Word has length 93 [2018-04-12 18:28:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:28:41,722 INFO L459 AbstractCegarLoop]: Abstraction has 778 states and 877 transitions. [2018-04-12 18:28:41,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 18:28:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 877 transitions. [2018-04-12 18:28:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-12 18:28:41,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:28:41,723 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:28:41,723 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:28:41,724 INFO L82 PathProgramCache]: Analyzing trace with hash 204776059, now seen corresponding path program 3 times [2018-04-12 18:28:41,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:28:41,724 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:28:41,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:41,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:28:41,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:28:41,730 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:28:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:28:41,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:28:41,869 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:28:41,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 18:28:41,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-12 18:28:41,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:28:41,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:28:41,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:41,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:41,973 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-12 18:28:41,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:41,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:41,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-12 18:28:41,996 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-12 18:28:41,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:28:41,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:41,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,005 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-12 18:28:42,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-04-12 18:28:42,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 18:28:42,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:28:42,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-12 18:28:42,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-12 18:28:42,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:28:42,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-04-12 18:28:42,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:28:42,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-04-12 18:28:42,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,216 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 43 treesize of output 40 [2018-04-12 18:28:42,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,219 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 21 treesize of output 23 [2018-04-12 18:28:42,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,234 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-12 18:28:42,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:44 [2018-04-12 18:28:42,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 72 [2018-04-12 18:28:42,348 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 74 treesize of output 73 [2018-04-12 18:28:42,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,383 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 43 treesize of output 54 [2018-04-12 18:28:42,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:28:42,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:28:42,424 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 2 xjuncts. [2018-04-12 18:28:42,424 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:103 [2018-04-12 18:28:42,477 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:28:42,478 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 69 treesize of output 53 [2018-04-12 18:28:42,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-04-12 18:28:42,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 81 [2018-04-12 18:28:42,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,529 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 88 treesize of output 103 [2018-04-12 18:28:42,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:42,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:42,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 79 [2018-04-12 18:28:42,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 18:28:42,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:28:42,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 18:28:42,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:163, output treesize:191 [2018-04-12 18:28:43,783 WARN L151 SmtUtils]: Spent 411ms on a formula simplification. DAG size of input: 56 DAG size of output 43 [2018-04-12 18:28:43,852 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 61 treesize of output 48 [2018-04-12 18:28:43,853 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:28:43,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-12 18:28:43,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:43,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:43,861 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-12 18:28:43,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:43,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:43,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 71 [2018-04-12 18:28:43,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:43,888 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 61 treesize of output 55 [2018-04-12 18:28:43,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:43,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:43,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:43,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 62 [2018-04-12 18:28:43,921 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:28:43,952 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:28:43,953 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 49 treesize of output 41 [2018-04-12 18:28:43,953 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:43,979 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:28:43,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-12 18:28:43,979 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:43,980 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:28:43,980 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 38 treesize of output 32 [2018-04-12 18:28:43,981 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:44,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:44,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-04-12 18:28:44,005 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:44,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:44,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:44,023 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:156, output treesize:5 [2018-04-12 18:28:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:28:44,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:28:44,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2018-04-12 18:28:44,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 18:28:44,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 18:28:44,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=929, Unknown=1, NotChecked=0, Total=1056 [2018-04-12 18:28:44,085 INFO L87 Difference]: Start difference. First operand 778 states and 877 transitions. Second operand 33 states. [2018-04-12 18:28:44,968 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 99 DAG size of output 55 [2018-04-12 18:28:45,982 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 102 DAG size of output 58 [2018-04-12 18:28:51,563 WARN L151 SmtUtils]: Spent 5432ms on a formula simplification. DAG size of input: 67 DAG size of output 67 [2018-04-12 18:28:51,866 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-04-12 18:28:54,866 WARN L151 SmtUtils]: Spent 2688ms on a formula simplification. DAG size of input: 48 DAG size of output 48 [2018-04-12 18:28:55,378 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 99 DAG size of output 55 [2018-04-12 18:28:55,778 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-04-12 18:28:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:28:56,036 INFO L93 Difference]: Finished difference Result 1116 states and 1250 transitions. [2018-04-12 18:28:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 18:28:56,036 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-04-12 18:28:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:28:56,038 INFO L225 Difference]: With dead ends: 1116 [2018-04-12 18:28:56,038 INFO L226 Difference]: Without dead ends: 1116 [2018-04-12 18:28:56,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=594, Invalid=2943, Unknown=3, NotChecked=0, Total=3540 [2018-04-12 18:28:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2018-04-12 18:28:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 880. [2018-04-12 18:28:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-04-12 18:28:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 990 transitions. [2018-04-12 18:28:56,044 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 990 transitions. Word has length 94 [2018-04-12 18:28:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:28:56,044 INFO L459 AbstractCegarLoop]: Abstraction has 880 states and 990 transitions. [2018-04-12 18:28:56,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 18:28:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 990 transitions. [2018-04-12 18:28:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-12 18:28:56,045 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:28:56,045 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:28:56,045 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:28:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 204776060, now seen corresponding path program 2 times [2018-04-12 18:28:56,045 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:28:56,045 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:28:56,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:56,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:28:56,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:28:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:28:56,051 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:28:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:28:56,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:28:56,295 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:28:56,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:28:56,349 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:28:56,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:28:56,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:28:56,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,425 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-12 18:28:56,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-12 18:28:56,473 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-12 18:28:56,475 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-12 18:28:56,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,491 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-12 18:28:56,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:28:56,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,504 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-12 18:28:56,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-12 18:28:56,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:28:56,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, 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-12 18:28:56,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:28:56,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:28:56,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-04-12 18:28:56,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-04-12 18:28:56,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,731 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-12 18:28:56,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,775 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-12 18:28:56,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:28:56,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:93 [2018-04-12 18:28:56,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,847 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-12 18:28:56,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 18:28:56,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:96 [2018-04-12 18:28:56,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2018-04-12 18:28:56,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:28:56,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,973 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 43 [2018-04-12 18:28:56,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:56,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-04-12 18:28:56,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:56,997 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-12 18:28:56,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:90 [2018-04-12 18:28:57,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,105 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 109 treesize of output 105 [2018-04-12 18:28:57,107 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-12 18:28:57,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,147 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 32 treesize of output 57 [2018-04-12 18:28:57,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:28:57,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,171 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-12 18:28:57,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:136, output treesize:136 [2018-04-12 18:28:57,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 175 treesize of output 132 [2018-04-12 18:28:57,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,235 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-12 18:28:57,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,277 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 65 treesize of output 80 [2018-04-12 18:28:57,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,279 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-12 18:28:57,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,304 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-12 18:28:57,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:191, output treesize:167 [2018-04-12 18:28:57,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 102 [2018-04-12 18:28:57,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,501 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-12 18:28:57,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-04-12 18:28:57,521 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-12 18:28:57,536 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:28:57,536 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 38 treesize of output 28 [2018-04-12 18:28:57,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,547 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-12 18:28:57,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-04-12 18:28:57,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:28:57,573 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-12 18:28:57,573 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,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, 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-12 18:28:57,581 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,585 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:28:57,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-12 18:28:57,586 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:28:57,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:28:57,598 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:187, output treesize:18 [2018-04-12 18:28:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:28:57,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:28:57,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2018-04-12 18:28:57,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-12 18:28:57,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-12 18:28:57,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 18:28:57,769 INFO L87 Difference]: Start difference. First operand 880 states and 990 transitions. Second operand 36 states. [2018-04-12 18:28:59,926 WARN L151 SmtUtils]: Spent 403ms on a formula simplification. DAG size of input: 68 DAG size of output 63 [2018-04-12 18:29:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:29:01,936 INFO L93 Difference]: Finished difference Result 1134 states and 1260 transitions. [2018-04-12 18:29:01,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 18:29:01,936 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 94 [2018-04-12 18:29:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:29:01,939 INFO L225 Difference]: With dead ends: 1134 [2018-04-12 18:29:01,939 INFO L226 Difference]: Without dead ends: 1134 [2018-04-12 18:29:01,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=682, Invalid=3874, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 18:29:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2018-04-12 18:29:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 926. [2018-04-12 18:29:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-04-12 18:29:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1046 transitions. [2018-04-12 18:29:01,948 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1046 transitions. Word has length 94 [2018-04-12 18:29:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:29:01,949 INFO L459 AbstractCegarLoop]: Abstraction has 926 states and 1046 transitions. [2018-04-12 18:29:01,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-12 18:29:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1046 transitions. [2018-04-12 18:29:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-12 18:29:01,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:29:01,949 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:29:01,949 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:29:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash 472112552, now seen corresponding path program 2 times [2018-04-12 18:29:01,950 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:29:01,950 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:29:01,950 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:29:01,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:29:01,950 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:29:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:29:01,963 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:29:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:29:02,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:29:02,489 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:29:02,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:29:02,527 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:29:02,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:29:02,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:29:02,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:02,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:02,560 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-12 18:29:02,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 18:29:02,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:29:02,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:29:02,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,598 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-12 18:29:02,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 18:29:02,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-12 18:29:02,654 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-12 18:29:02,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,662 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-12 18:29:02,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 18:29:02,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-12 18:29:02,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:29:02,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:02,797 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-12 18:29:02,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 18:29:08,849 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 18:29:08,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:08,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:08,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:08,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-12 18:29:08,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:08,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:29:08,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-12 18:29:08,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-12 18:29:08,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:08,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-12 18:29:08,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:08,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:08,971 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-12 18:29:08,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-12 18:29:09,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 100 [2018-04-12 18:29:09,149 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-12 18:29:09,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,177 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-12 18:29:09,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:85 [2018-04-12 18:29:09,250 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 83 treesize of output 85 [2018-04-12 18:29:09,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,252 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-12 18:29:09,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,274 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-12 18:29:09,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:94 [2018-04-12 18:29:09,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 95 [2018-04-12 18:29:09,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:29:09,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:105, output treesize:121 [2018-04-12 18:29:09,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 108 [2018-04-12 18:29:09,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:29:09,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:29:09,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:132, output treesize:130 [2018-04-12 18:29:09,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 167 [2018-04-12 18:29:09,723 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-12 18:29:09,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,758 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-12 18:29:09,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:173, output treesize:161 [2018-04-12 18:29:09,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 152 [2018-04-12 18:29:09,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:09,847 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-12 18:29:09,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:29:09,881 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-12 18:29:09,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:195, output treesize:183 [2018-04-12 18:29:12,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 105 [2018-04-12 18:29:12,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:12,152 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-12 18:29:12,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:12,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:29:12,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-12 18:29:12,168 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-12 18:29:12,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2018-04-12 18:29:12,180 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-12 18:29:12,191 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-12 18:29:12,191 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:29:12,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:29:12,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:29:12,210 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:177, output treesize:45 [2018-04-12 18:29:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:29:12,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:29:12,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2018-04-12 18:29:12,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 18:29:12,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 18:29:12,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2252, Unknown=3, NotChecked=0, Total=2652 [2018-04-12 18:29:12,397 INFO L87 Difference]: Start difference. First operand 926 states and 1046 transitions. Second operand 52 states. [2018-04-12 18:29:29,045 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-04-12 18:30:02,492 WARN L151 SmtUtils]: Spent 4149ms on a formula simplification. DAG size of input: 95 DAG size of output 82 [2018-04-12 18:30:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:30:12,086 INFO L93 Difference]: Finished difference Result 2257 states and 2590 transitions. [2018-04-12 18:30:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-12 18:30:12,086 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 97 [2018-04-12 18:30:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:30:12,090 INFO L225 Difference]: With dead ends: 2257 [2018-04-12 18:30:12,090 INFO L226 Difference]: Without dead ends: 2257 [2018-04-12 18:30:12,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3172 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=2303, Invalid=9673, Unknown=14, NotChecked=0, Total=11990 [2018-04-12 18:30:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2018-04-12 18:30:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 967. [2018-04-12 18:30:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-04-12 18:30:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1091 transitions. [2018-04-12 18:30:12,102 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1091 transitions. Word has length 97 [2018-04-12 18:30:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:30:12,102 INFO L459 AbstractCegarLoop]: Abstraction has 967 states and 1091 transitions. [2018-04-12 18:30:12,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 18:30:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1091 transitions. [2018-04-12 18:30:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-12 18:30:12,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:30:12,103 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-12 18:30:12,103 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:30:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash -20560611, now seen corresponding path program 1 times [2018-04-12 18:30:12,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:30:12,103 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:30:12,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:30:12,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:30:12,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:30:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:30:12,114 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:30:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:30:12,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:30:12,852 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:30:12,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:30:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:30:12,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:30:12,942 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-12 18:30:12,943 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-12 18:30:12,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:12,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:12,950 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-12 18:30:12,951 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-12 18:30:12,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:12,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:12,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:12,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-12 18:30:13,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,012 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-12 18:30:13,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:45 [2018-04-12 18:30:13,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-12 18:30:13,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,060 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-12 18:30:13,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-12 18:30:13,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:30:13,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,094 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-12 18:30:13,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:53 [2018-04-12 18:30:13,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-12 18:30:13,207 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-12 18:30:13,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-12 18:30:13,226 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-12 18:30:13,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-04-12 18:30:13,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,287 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 65 treesize of output 64 [2018-04-12 18:30:13,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,290 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-12 18:30:13,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,317 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 34 treesize of output 40 [2018-04-12 18:30:13,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:30:13,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:94 [2018-04-12 18:30:13,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-12 18:30:13,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:111 [2018-04-12 18:30:13,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,470 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 93 treesize of output 90 [2018-04-12 18:30:13,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:30:13,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-04-12 18:30:13,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-04-12 18:30:13,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,536 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-12 18:30:13,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:105 [2018-04-12 18:30:13,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2018-04-12 18:30:13,704 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-12 18:30:13,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,740 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 34 treesize of output 59 [2018-04-12 18:30:13,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 16 treesize of output 15 [2018-04-12 18:30:13,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,763 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-12 18:30:13,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:139 [2018-04-12 18:30:13,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-04-12 18:30:13,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:30:13,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:144, output treesize:136 [2018-04-12 18:30:13,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 116 [2018-04-12 18:30:13,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12 18:30:13,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 77 [2018-04-12 18:30:13,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:13,958 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-12 18:30:13,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:13,984 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-12 18:30:13,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:162, output treesize:154 [2018-04-12 18:30:14,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:14,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 180 [2018-04-12 18:30:14,126 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-12 18:30:14,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 130 [2018-04-12 18:30:14,183 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-12 18:30:14,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,216 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-12 18:30:14,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:200, output treesize:172 [2018-04-12 18:30:14,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 192 [2018-04-12 18:30:14,390 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 30 treesize of output 45 [2018-04-12 18:30:14,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 169 [2018-04-12 18:30:14,449 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 30 treesize of output 45 [2018-04-12 18:30:14,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:14,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 18:30:14,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:307, output treesize:271 [2018-04-12 18:30:18,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 148 [2018-04-12 18:30:18,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:18,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-04-12 18:30:18,681 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-12 18:30:18,701 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-12 18:30:18,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:18,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:18,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-04-12 18:30:18,717 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-12 18:30:18,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:18,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2018-04-12 18:30:18,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:30:18,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:30:18,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-04-12 18:30:18,780 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-12 18:30:18,780 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:18,790 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-12 18:30:18,790 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:18,795 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-12 18:30:18,795 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:18,807 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-12 18:30:18,807 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:18,808 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:18,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:18,818 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:289, output treesize:7 [2018-04-12 18:30:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:30:18,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:30:18,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 54 [2018-04-12 18:30:18,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 18:30:18,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 18:30:18,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=2489, Unknown=2, NotChecked=0, Total=2862 [2018-04-12 18:30:18,938 INFO L87 Difference]: Start difference. First operand 967 states and 1091 transitions. Second operand 54 states. [2018-04-12 18:30:26,530 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 124 DAG size of output 99 [2018-04-12 18:30:30,701 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 114 DAG size of output 97 [2018-04-12 18:30:34,945 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 148 DAG size of output 127 [2018-04-12 18:30:41,250 WARN L151 SmtUtils]: Spent 4129ms on a formula simplification. DAG size of input: 122 DAG size of output 109 [2018-04-12 18:30:47,541 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 118 DAG size of output 105 [2018-04-12 18:30:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:30:56,699 INFO L93 Difference]: Finished difference Result 1367 states and 1529 transitions. [2018-04-12 18:30:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-12 18:30:56,699 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2018-04-12 18:30:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:30:56,701 INFO L225 Difference]: With dead ends: 1367 [2018-04-12 18:30:56,701 INFO L226 Difference]: Without dead ends: 1367 [2018-04-12 18:30:56,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4719 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=2809, Invalid=14465, Unknown=18, NotChecked=0, Total=17292 [2018-04-12 18:30:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-04-12 18:30:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 979. [2018-04-12 18:30:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2018-04-12 18:30:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1104 transitions. [2018-04-12 18:30:56,707 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1104 transitions. Word has length 97 [2018-04-12 18:30:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:30:56,708 INFO L459 AbstractCegarLoop]: Abstraction has 979 states and 1104 transitions. [2018-04-12 18:30:56,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 18:30:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1104 transitions. [2018-04-12 18:30:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-04-12 18:30:56,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:30:56,708 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:30:56,708 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:30:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1638251000, now seen corresponding path program 1 times [2018-04-12 18:30:56,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:30:56,709 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:30:56,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:30:56,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:30:56,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:30:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:30:56,714 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:30:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:30:56,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:30:56,844 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:30:56,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:30:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:30:56,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:30:56,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:56,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:56,926 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-12 18:30:56,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:56,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:56,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-12 18:30:56,952 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-12 18:30:56,953 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-12 18:30:56,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:56,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:56,966 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-12 18:30:56,967 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-12 18:30:56,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:56,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:56,977 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-12 18:30:56,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-12 18:30:56,998 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-12 18:30:56,999 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-12 18:30:56,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2018-04-12 18:30:57,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 18:30:57,034 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-12 18:30:57,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-04-12 18:30:57,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 18:30:57,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:57,062 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-12 18:30:57,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,070 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-12 18:30:57,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-04-12 18:30:57,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-12 18:30:57,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 11 treesize of output 3 [2018-04-12 18:30:57,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:30:57,192 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-12 18:30:57,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:30:57,196 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-12 18:30:57,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-04-12 18:30:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-12 18:30:57,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:30:57,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-04-12 18:30:57,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 18:30:57,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 18:30:57,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-04-12 18:30:57,261 INFO L87 Difference]: Start difference. First operand 979 states and 1104 transitions. Second operand 24 states. [2018-04-12 18:30:57,999 WARN L148 SmtUtils]: Spent 209ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-12 18:30:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:30:59,406 INFO L93 Difference]: Finished difference Result 1322 states and 1481 transitions. [2018-04-12 18:30:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 18:30:59,406 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-04-12 18:30:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:30:59,408 INFO L225 Difference]: With dead ends: 1322 [2018-04-12 18:30:59,408 INFO L226 Difference]: Without dead ends: 1322 [2018-04-12 18:30:59,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=364, Invalid=2086, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 18:30:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-04-12 18:30:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1214. [2018-04-12 18:30:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-04-12 18:30:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1399 transitions. [2018-04-12 18:30:59,414 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1399 transitions. Word has length 98 [2018-04-12 18:30:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:30:59,414 INFO L459 AbstractCegarLoop]: Abstraction has 1214 states and 1399 transitions. [2018-04-12 18:30:59,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 18:30:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1399 transitions. [2018-04-12 18:30:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-12 18:30:59,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:30:59,415 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-12 18:30:59,415 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:30:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1600241069, now seen corresponding path program 1 times [2018-04-12 18:30:59,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:30:59,415 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:30:59,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:30:59,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:30:59,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:30:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:30:59,424 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:30:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:30:59,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:30:59,985 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:30:59,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:31:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:31:00,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:31:00,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,053 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-12 18:31:00,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:31:00,079 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-12 18:31:00,080 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-12 18:31:00,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,087 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-12 18:31:00,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:31:00,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:31:00,155 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-12 18:31:00,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-12 18:31:00,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-12 18:31:00,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,194 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-12 18:31:00,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-04-12 18:31:00,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,237 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-12 18:31:00,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:63 [2018-04-12 18:31:00,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,306 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 60 treesize of output 57 [2018-04-12 18:31:00,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:31:00,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,328 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-12 18:31:00,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:64 [2018-04-12 18:31:00,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,452 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 94 treesize of output 90 [2018-04-12 18:31:00,454 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-12 18:31:00,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,475 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-12 18:31:00,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:95 [2018-04-12 18:31:00,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 107 [2018-04-12 18:31:00,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:31:00,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:124 [2018-04-12 18:31:00,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 113 [2018-04-12 18:31:00,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:00,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12 18:31:00,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,648 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-12 18:31:00,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:132 [2018-04-12 18:31:00,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 145 [2018-04-12 18:31:00,753 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-12 18:31:00,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,783 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-12 18:31:00,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:137 [2018-04-12 18:31:00,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 150 [2018-04-12 18:31:00,938 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 30 treesize of output 45 [2018-04-12 18:31:00,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:00,971 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-12 18:31:00,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:239, output treesize:221 [2018-04-12 18:31:05,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 113 [2018-04-12 18:31:05,169 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-12 18:31:05,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:05,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:05,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-04-12 18:31:05,190 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-12 18:31:05,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-04-12 18:31:05,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:05,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:05,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-04-12 18:31:05,217 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:31:05,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:31:05,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:31:05,236 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:228, output treesize:45 [2018-04-12 18:31:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:31:05,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:31:05,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 49 [2018-04-12 18:31:05,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 18:31:05,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 18:31:05,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2152, Unknown=2, NotChecked=0, Total=2450 [2018-04-12 18:31:05,510 INFO L87 Difference]: Start difference. First operand 1214 states and 1399 transitions. Second operand 50 states. [2018-04-12 18:31:12,508 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 126 DAG size of output 78 [2018-04-12 18:31:20,922 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 152 DAG size of output 100 [2018-04-12 18:31:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:31:49,888 INFO L93 Difference]: Finished difference Result 1988 states and 2288 transitions. [2018-04-12 18:31:49,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-12 18:31:49,888 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2018-04-12 18:31:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:31:49,891 INFO L225 Difference]: With dead ends: 1988 [2018-04-12 18:31:49,891 INFO L226 Difference]: Without dead ends: 1988 [2018-04-12 18:31:49,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3117 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=1818, Invalid=8259, Unknown=23, NotChecked=0, Total=10100 [2018-04-12 18:31:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-04-12 18:31:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1395. [2018-04-12 18:31:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1395 states. [2018-04-12 18:31:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1603 transitions. [2018-04-12 18:31:49,904 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1603 transitions. Word has length 99 [2018-04-12 18:31:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:31:49,904 INFO L459 AbstractCegarLoop]: Abstraction has 1395 states and 1603 transitions. [2018-04-12 18:31:49,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 18:31:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1603 transitions. [2018-04-12 18:31:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-12 18:31:49,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:31:49,905 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-12 18:31:49,905 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:31:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1600241070, now seen corresponding path program 1 times [2018-04-12 18:31:49,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:31:49,906 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:31:49,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:31:49,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:31:49,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:31:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:31:49,918 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:31:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:31:50,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:31:50,575 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:31:50,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:31:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:31:50,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:31:50,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,647 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-12 18:31:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 18:31:50,672 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-12 18:31:50,673 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-12 18:31:50,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,682 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-12 18:31:50,683 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-12 18:31:50,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,690 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-12 18:31:50,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 18:31:50,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:31:50,762 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-12 18:31:50,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-12 18:31:50,776 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-12 18:31:50,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-12 18:31:50,822 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-12 18:31:50,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:31:50,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,846 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 69 treesize of output 68 [2018-04-12 18:31:50,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,848 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-12 18:31:50,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:87 [2018-04-12 18:31:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,908 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-12 18:31:50,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 18:31:50,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:50,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:109 [2018-04-12 18:31:50,992 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 43 [2018-04-12 18:31:50,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:50,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-04-12 18:31:50,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,025 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 78 treesize of output 75 [2018-04-12 18:31:51,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:31:51,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,057 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-12 18:31:51,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:136, output treesize:103 [2018-04-12 18:31:51,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,188 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 131 treesize of output 123 [2018-04-12 18:31:51,190 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-12 18:31:51,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,228 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 32 treesize of output 57 [2018-04-12 18:31:51,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:31:51,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,263 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-12 18:31:51,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:157, output treesize:149 [2018-04-12 18:31:51,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 66 [2018-04-12 18:31:51,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-04-12 18:31:51,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,373 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-12 18:31:51,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:151 [2018-04-12 18:31:51,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 127 [2018-04-12 18:31:51,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12 18:31:51,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-04-12 18:31:51,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,488 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-12 18:31:51,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,526 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-12 18:31:51,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:177, output treesize:175 [2018-04-12 18:31:51,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:51,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 202 [2018-04-12 18:31:51,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 14 treesize of output 13 [2018-04-12 18:31:51,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 128 [2018-04-12 18:31:51,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:31:51,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,739 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-12 18:31:51,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:221, output treesize:193 [2018-04-12 18:31:51,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 214 [2018-04-12 18:31:51,909 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 30 treesize of output 45 [2018-04-12 18:31:51,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:51,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 167 [2018-04-12 18:31:51,991 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 30 treesize of output 45 [2018-04-12 18:31:51,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:52,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:52,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 18:31:52,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:336, output treesize:300 [2018-04-12 18:31:56,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 159 [2018-04-12 18:31:56,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:56,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 44 [2018-04-12 18:31:56,211 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-12 18:31:56,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:31:56,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-04-12 18:31:56,233 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-12 18:31:56,251 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-12 18:31:56,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:56,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 44 treesize of output 29 [2018-04-12 18:31:56,267 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:56,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:31:56,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-04-12 18:31:56,303 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-12 18:31:56,303 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:56,313 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-12 18:31:56,314 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:56,319 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-12 18:31:56,319 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:56,322 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-12 18:31:56,322 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:31:56,323 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:31:56,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:31:56,332 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:314, output treesize:31 [2018-04-12 18:31:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:31:56,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:31:56,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 50 [2018-04-12 18:31:56,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-12 18:31:56,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-12 18:31:56,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2329, Unknown=2, NotChecked=0, Total=2550 [2018-04-12 18:31:56,524 INFO L87 Difference]: Start difference. First operand 1395 states and 1603 transitions. Second operand 51 states. [2018-04-12 18:32:04,171 WARN L151 SmtUtils]: Spent 4252ms on a formula simplification. DAG size of input: 177 DAG size of output 122 [2018-04-12 18:32:08,410 WARN L151 SmtUtils]: Spent 4141ms on a formula simplification. DAG size of input: 162 DAG size of output 118 [2018-04-12 18:32:12,719 WARN L151 SmtUtils]: Spent 4175ms on a formula simplification. DAG size of input: 186 DAG size of output 122 [2018-04-12 18:32:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:32:16,111 INFO L93 Difference]: Finished difference Result 2011 states and 2300 transitions. [2018-04-12 18:32:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-12 18:32:16,111 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-04-12 18:32:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:32:16,112 INFO L225 Difference]: With dead ends: 2011 [2018-04-12 18:32:16,112 INFO L226 Difference]: Without dead ends: 2011 [2018-04-12 18:32:16,113 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3800 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=1965, Invalid=10465, Unknown=2, NotChecked=0, Total=12432 [2018-04-12 18:32:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2018-04-12 18:32:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1441. [2018-04-12 18:32:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-04-12 18:32:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1659 transitions. [2018-04-12 18:32:16,125 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1659 transitions. Word has length 99 [2018-04-12 18:32:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:32:16,125 INFO L459 AbstractCegarLoop]: Abstraction has 1441 states and 1659 transitions. [2018-04-12 18:32:16,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-12 18:32:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1659 transitions. [2018-04-12 18:32:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-12 18:32:16,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:32:16,126 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-12 18:32:16,126 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:32:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 319601357, now seen corresponding path program 2 times [2018-04-12 18:32:16,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:32:16,126 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:32:16,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:32:16,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:32:16,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:32:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:32:16,134 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:32:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:32:16,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:32:16,549 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:32:16,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:32:16,576 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:32:16,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:32:16,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:32:16,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:16,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:16,603 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-12 18:32:16,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 18:32:16,629 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-12 18:32:16,630 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-12 18:32:16,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,637 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-12 18:32:16,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-12 18:32:16,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 18:32:16,693 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-12 18:32:16,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-12 18:32:16,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:16,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:16,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:16,727 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 22 treesize of output 42 [2018-04-12 18:32:16,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:49 [2018-04-12 18:32:16,765 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 37 treesize of output 36 [2018-04-12 18:32:16,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:16,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:32:16,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,786 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-12 18:32:16,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:67 [2018-04-12 18:32:16,847 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 76 [2018-04-12 18:32:16,848 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-12 18:32:16,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,864 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-12 18:32:16,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:80 [2018-04-12 18:32:16,968 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 93 treesize of output 83 [2018-04-12 18:32:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:32:16,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:16,989 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-12 18:32:16,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:95 [2018-04-12 18:32:21,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-04-12 18:32:21,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:32:21,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:87 [2018-04-12 18:32:21,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 [2018-04-12 18:32:21,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 73 [2018-04-12 18:32:21,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,196 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-12 18:32:21,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:93 [2018-04-12 18:32:21,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 138 [2018-04-12 18:32:21,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 8 treesize of output 7 [2018-04-12 18:32:21,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,342 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-12 18:32:21,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:144, output treesize:116 [2018-04-12 18:32:21,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 123 [2018-04-12 18:32:21,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,396 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-12 18:32:21,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,419 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-12 18:32:21,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:166, output treesize:154 [2018-04-12 18:32:21,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 97 [2018-04-12 18:32:21,585 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-12 18:32:21,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:21,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, 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-12 18:32:21,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:32:21,605 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 37 treesize of output 27 [2018-04-12 18:32:21,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-04-12 18:32:21,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:21,636 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:164, output treesize:5 [2018-04-12 18:32:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:32:21,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:32:21,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 47 [2018-04-12 18:32:21,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 18:32:21,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 18:32:21,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1909, Unknown=11, NotChecked=0, Total=2256 [2018-04-12 18:32:21,723 INFO L87 Difference]: Start difference. First operand 1441 states and 1659 transitions. Second operand 48 states. [2018-04-12 18:32:38,802 WARN L151 SmtUtils]: Spent 2058ms on a formula simplification. DAG size of input: 72 DAG size of output 63 [2018-04-12 18:32:46,667 WARN L151 SmtUtils]: Spent 598ms on a formula simplification. DAG size of input: 76 DAG size of output 74 [2018-04-12 18:32:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:32:48,660 INFO L93 Difference]: Finished difference Result 2585 states and 2967 transitions. [2018-04-12 18:32:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-12 18:32:48,660 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 99 [2018-04-12 18:32:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:32:48,663 INFO L225 Difference]: With dead ends: 2585 [2018-04-12 18:32:48,663 INFO L226 Difference]: Without dead ends: 2585 [2018-04-12 18:32:48,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4725 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=2466, Invalid=10388, Unknown=28, NotChecked=0, Total=12882 [2018-04-12 18:32:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2018-04-12 18:32:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 1543. [2018-04-12 18:32:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1543 states. [2018-04-12 18:32:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1773 transitions. [2018-04-12 18:32:48,676 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1773 transitions. Word has length 99 [2018-04-12 18:32:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:32:48,676 INFO L459 AbstractCegarLoop]: Abstraction has 1543 states and 1773 transitions. [2018-04-12 18:32:48,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 18:32:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1773 transitions. [2018-04-12 18:32:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-12 18:32:48,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:32:48,684 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-12 18:32:48,684 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:32:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash 319601358, now seen corresponding path program 2 times [2018-04-12 18:32:48,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:32:48,684 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:32:48,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:32:48,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:32:48,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:32:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:32:48,694 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:32:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:32:49,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:32:49,333 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:32:49,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:32:49,362 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:32:49,362 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:32:49,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:32:49,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,401 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-12 18:32:49,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 18:32:49,433 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-12 18:32:49,434 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-12 18:32:49,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,445 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-12 18:32:49,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:32:49,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,454 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-12 18:32:49,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-12 18:32:49,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:32:49,547 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-12 18:32:49,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:32:49,565 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-12 18:32:49,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-04-12 18:32:49,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,624 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-12 18:32:49,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:78 [2018-04-12 18:32:49,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-12 18:32:49,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:32:49,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,726 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 32 treesize of output 38 [2018-04-12 18:32:49,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:32:49,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,750 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-12 18:32:49,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:99 [2018-04-12 18:32:49,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:49,855 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 115 treesize of output 123 [2018-04-12 18:32:49,857 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-12 18:32:49,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,893 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 42 treesize of output 65 [2018-04-12 18:32:49,894 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-12 18:32:49,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:49,925 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-12 18:32:49,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:145, output treesize:121 [2018-04-12 18:32:50,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-04-12 18:32:50,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:32:50,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:50,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:50,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:50,135 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 131 treesize of output 121 [2018-04-12 18:32:50,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:32:50,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:50,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:50,170 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-12 18:32:50,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:171, output treesize:151 [2018-04-12 18:32:54,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 18:32:54,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-04-12 18:32:54,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,362 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-12 18:32:54,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:131 [2018-04-12 18:32:54,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2018-04-12 18:32:54,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-12 18:32:54,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2018-04-12 18:32:54,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 74 [2018-04-12 18:32:54,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,508 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-12 18:32:54,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:153, output treesize:129 [2018-04-12 18:32:54,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,671 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-04-12 18:32:54,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:32:54,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 175 [2018-04-12 18:32:54,710 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-12 18:32:54,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,752 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-12 18:32:54,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:199, output treesize:175 [2018-04-12 18:32:54,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 71 treesize of output 98 [2018-04-12 18:32:54,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,824 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-12 18:32:54,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 173 [2018-04-12 18:32:54,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:54,870 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-12 18:32:54,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:54,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:32:54,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:254, output treesize:230 [2018-04-12 18:32:55,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 139 [2018-04-12 18:32:55,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 7 treesize of output 1 [2018-04-12 18:32:55,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:55,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 61 [2018-04-12 18:32:55,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:32:55,285 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:32:55,286 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 33 treesize of output 23 [2018-04-12 18:32:55,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:55,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:55,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:32:55,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:55,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:32:55,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-04-12 18:32:55,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:32:55,336 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-12 18:32:55,336 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:55,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:32:55,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-12 18:32:55,349 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:55,353 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-12 18:32:55,353 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:32:55,355 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:32:55,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:32:55,365 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:247, output treesize:18 [2018-04-12 18:32:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:32:55,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:32:55,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 52 [2018-04-12 18:32:55,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-12 18:32:55,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-12 18:32:55,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2403, Unknown=2, NotChecked=0, Total=2756 [2018-04-12 18:32:55,575 INFO L87 Difference]: Start difference. First operand 1543 states and 1773 transitions. Second operand 53 states. [2018-04-12 18:33:09,179 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 96 DAG size of output 72 [2018-04-12 18:33:11,358 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 103 DAG size of output 72 [2018-04-12 18:33:18,180 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 107 DAG size of output 80 [2018-04-12 18:33:18,542 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 126 DAG size of output 99 [2018-04-12 18:33:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:33:26,060 INFO L93 Difference]: Finished difference Result 2140 states and 2437 transitions. [2018-04-12 18:33:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-12 18:33:26,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 99 [2018-04-12 18:33:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:33:26,063 INFO L225 Difference]: With dead ends: 2140 [2018-04-12 18:33:26,063 INFO L226 Difference]: Without dead ends: 2140 [2018-04-12 18:33:26,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5429 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=2631, Invalid=13845, Unknown=36, NotChecked=0, Total=16512 [2018-04-12 18:33:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2018-04-12 18:33:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1551. [2018-04-12 18:33:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2018-04-12 18:33:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1777 transitions. [2018-04-12 18:33:26,078 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1777 transitions. Word has length 99 [2018-04-12 18:33:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:33:26,078 INFO L459 AbstractCegarLoop]: Abstraction has 1551 states and 1777 transitions. [2018-04-12 18:33:26,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-12 18:33:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1777 transitions. [2018-04-12 18:33:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-12 18:33:26,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:33:26,079 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:33:26,079 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:33:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash 450659647, now seen corresponding path program 1 times [2018-04-12 18:33:26,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:33:26,080 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:33:26,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:33:26,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:33:26,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:33:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:33:26,086 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:33:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:33:26,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:33:26,592 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:33:26,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:33:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:33:26,617 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:33:27,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,156 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 69 treesize of output 73 [2018-04-12 18:33:27,158 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,158 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 66 treesize of output 62 [2018-04-12 18:33:27,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,174 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,175 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 62 [2018-04-12 18:33:27,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:33:27,200 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-04-12 18:33:27,200 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-12 18:33:27,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 18:33:27,242 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 40 treesize of output 38 [2018-04-12 18:33:27,244 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,244 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 34 treesize of output 30 [2018-04-12 18:33:27,244 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:27,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:27,257 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,258 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-04-12 18:33:27,261 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,267 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,269 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-12 18:33:27,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-04-12 18:33:27,271 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:27,277 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-12 18:33:27,277 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,279 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,284 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 30 treesize of output 30 [2018-04-12 18:33:27,285 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-12 18:33:27,286 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:27,295 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 11 [2018-04-12 18:33:27,296 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,305 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:27,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:27,307 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:33:27,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-12 18:33:27,310 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,315 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:27,323 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-12 18:33:27,323 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:78, output treesize:7 [2018-04-12 18:33:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:33:27,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:33:27,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 34 [2018-04-12 18:33:27,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 18:33:27,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 18:33:27,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=987, Unknown=6, NotChecked=0, Total=1122 [2018-04-12 18:33:27,378 INFO L87 Difference]: Start difference. First operand 1551 states and 1777 transitions. Second operand 34 states. [2018-04-12 18:33:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:33:37,793 INFO L93 Difference]: Finished difference Result 2113 states and 2422 transitions. [2018-04-12 18:33:37,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-12 18:33:37,793 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 100 [2018-04-12 18:33:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:33:37,795 INFO L225 Difference]: With dead ends: 2113 [2018-04-12 18:33:37,795 INFO L226 Difference]: Without dead ends: 2113 [2018-04-12 18:33:37,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3873 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1473, Invalid=10443, Unknown=74, NotChecked=0, Total=11990 [2018-04-12 18:33:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2018-04-12 18:33:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1829. [2018-04-12 18:33:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2018-04-12 18:33:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2121 transitions. [2018-04-12 18:33:37,806 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2121 transitions. Word has length 100 [2018-04-12 18:33:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:33:37,807 INFO L459 AbstractCegarLoop]: Abstraction has 1829 states and 2121 transitions. [2018-04-12 18:33:37,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 18:33:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2121 transitions. [2018-04-12 18:33:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-12 18:33:37,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:33:37,807 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:33:37,808 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:33:37,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1332284160, now seen corresponding path program 1 times [2018-04-12 18:33:37,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:33:37,808 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:33:37,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:33:37,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:33:37,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:33:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:33:37,841 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:33:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:33:38,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:33:38,445 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:33:38,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:33:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:33:38,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:33:38,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:38,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:38,506 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-12 18:33:38,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-12 18:33:38,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:33:38,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:33:38,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,535 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-12 18:33:38,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:33:38,587 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 34 treesize of output 28 [2018-04-12 18:33:38,588 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-12 18:33:38,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,594 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-12 18:33:38,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2018-04-12 18:33:38,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-12 18:33:38,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 18:33:38,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:38,675 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-12 18:33:38,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 18:33:40,725 WARN L151 SmtUtils]: Spent 2010ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 18:33:40,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:40,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:40,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:40,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-12 18:33:40,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:40,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:40,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-12 18:33:40,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-12 18:33:40,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:40,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-12 18:33:40,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:40,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:40,848 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-12 18:33:40,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-12 18:33:40,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:40,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 100 [2018-04-12 18:33:40,991 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-12 18:33:40,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,011 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-12 18:33:41,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-12 18:33:41,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,089 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 91 treesize of output 93 [2018-04-12 18:33:41,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,091 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-12 18:33:41,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,114 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-12 18:33:41,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:95 [2018-04-12 18:33:41,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 97 [2018-04-12 18:33:41,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:41,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:122 [2018-04-12 18:33:41,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2018-04-12 18:33:41,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:33:41,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,316 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-12 18:33:41,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:133, output treesize:131 [2018-04-12 18:33:41,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 167 [2018-04-12 18:33:41,529 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-12 18:33:41,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,561 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-12 18:33:41,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:170, output treesize:150 [2018-04-12 18:33:41,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-04-12 18:33:41,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:41,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:161, output treesize:189 [2018-04-12 18:33:41,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 174 [2018-04-12 18:33:41,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:41,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:33:41,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:41,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:41,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:202, output treesize:219 [2018-04-12 18:33:42,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:42,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 232 [2018-04-12 18:33:42,052 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-12 18:33:42,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:42,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:42,117 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-12 18:33:42,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:242, output treesize:224 [2018-04-12 18:33:42,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 233 [2018-04-12 18:33:42,373 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 30 treesize of output 45 [2018-04-12 18:33:42,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:42,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:33:42,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:42,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:334, output treesize:316 [2018-04-12 18:33:47,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 164 [2018-04-12 18:33:47,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:47,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 47 treesize of output 36 [2018-04-12 18:33:47,005 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-12 18:33:47,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 47 [2018-04-12 18:33:47,030 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-12 18:33:47,055 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-12 18:33:47,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:47,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:33:47,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 47 treesize of output 28 [2018-04-12 18:33:47,077 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:47,093 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-12 18:33:47,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:33:47,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:47,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 18:33:47,117 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:308, output treesize:66 [2018-04-12 18:33:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:33:47,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:33:47,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-04-12 18:33:47,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-12 18:33:47,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-12 18:33:47,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=3273, Unknown=6, NotChecked=0, Total=3782 [2018-04-12 18:33:47,354 INFO L87 Difference]: Start difference. First operand 1829 states and 2121 transitions. Second operand 62 states. [2018-04-12 18:34:04,000 WARN L151 SmtUtils]: Spent 2058ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-04-12 18:34:14,284 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 104 DAG size of output 95 [2018-04-12 18:34:14,875 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 106 DAG size of output 97 [2018-04-12 18:34:19,092 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 115 DAG size of output 102 [2018-04-12 18:34:23,307 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 109 DAG size of output 98 [2018-04-12 18:34:27,650 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 134 DAG size of output 123 [2018-04-12 18:34:33,995 WARN L151 SmtUtils]: Spent 4139ms on a formula simplification. DAG size of input: 123 DAG size of output 114 [2018-04-12 18:34:40,297 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 119 DAG size of output 110 Received shutdown request... [2018-04-12 18:34:41,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-12 18:34:41,504 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 18:34:41,508 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 18:34:41,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 06:34:41 BoogieIcfgContainer [2018-04-12 18:34:41,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 18:34:41,509 INFO L168 Benchmark]: Toolchain (without parser) took 833049.84 ms. Allocated memory was 405.3 MB in the beginning and 562.6 MB in the end (delta: 157.3 MB). Free memory was 340.3 MB in the beginning and 425.1 MB in the end (delta: -84.8 MB). Peak memory consumption was 72.5 MB. Max. memory is 5.3 GB. [2018-04-12 18:34:41,510 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 405.3 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 18:34:41,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.86 ms. Allocated memory is still 405.3 MB. Free memory was 339.0 MB in the beginning and 312.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-12 18:34:41,511 INFO L168 Benchmark]: Boogie Preprocessor took 47.80 ms. Allocated memory is still 405.3 MB. Free memory was 312.5 MB in the beginning and 308.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 5.3 GB. [2018-04-12 18:34:41,511 INFO L168 Benchmark]: RCFGBuilder took 558.99 ms. Allocated memory was 405.3 MB in the beginning and 617.1 MB in the end (delta: 211.8 MB). Free memory was 308.4 MB in the beginning and 526.9 MB in the end (delta: -218.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-04-12 18:34:41,511 INFO L168 Benchmark]: TraceAbstraction took 832168.46 ms. Allocated memory was 617.1 MB in the beginning and 562.6 MB in the end (delta: -54.5 MB). Free memory was 526.9 MB in the beginning and 425.1 MB in the end (delta: 101.8 MB). Peak memory consumption was 47.2 MB. Max. memory is 5.3 GB. [2018-04-12 18:34:41,514 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.18 ms. Allocated memory is still 405.3 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 271.86 ms. Allocated memory is still 405.3 MB. Free memory was 339.0 MB in the beginning and 312.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.80 ms. Allocated memory is still 405.3 MB. Free memory was 312.5 MB in the beginning and 308.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 558.99 ms. Allocated memory was 405.3 MB in the beginning and 617.1 MB in the end (delta: 211.8 MB). Free memory was 308.4 MB in the beginning and 526.9 MB in the end (delta: -218.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 832168.46 ms. Allocated memory was 617.1 MB in the beginning and 562.6 MB in the end (delta: -54.5 MB). Free memory was 526.9 MB in the beginning and 425.1 MB in the end (delta: 101.8 MB). Peak memory consumption was 47.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (1829states) and interpolant automaton (currently 61 states, 62 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 63 error locations. TIMEOUT Result, 832.1s OverallTime, 62 OverallIterations, 3 TraceHistogramMax, 687.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10126 SDtfs, 67466 SDslu, 112269 SDs, 0 SdLazy, 94765 SolverSat, 7066 SolverUnsat, 339 SolverUnknown, 0 SolverNotchecked, 183.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5221 GetRequests, 2315 SyntacticMatches, 102 SemanticMatches, 2803 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63478 ImplicationChecksByTransitivity, 622.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1829occurred in iteration=61, 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.3s AutomataMinimizationTime, 61 MinimizatonAttempts, 12902 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 141.0s InterpolantComputationTime, 6657 NumberOfCodeBlocks, 6657 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 6562 ConstructedInterpolants, 1180 QuantifiedInterpolants, 19776024 SizeOfPredicates, 546 NumberOfNonLiveVariables, 8480 ConjunctsInSsa, 1461 ConjunctsInUnsatCore, 95 InterpolantComputations, 29 PerfectInterpolantSequences, 121/1045 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_18-34-41-520.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_18-34-41-520.csv Completed graceful shutdown