java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 22:51:13,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 22:51:13,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 22:51:13,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 22:51:13,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 22:51:13,549 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 22:51:13,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 22:51:13,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 22:51:13,553 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 22:51:13,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 22:51:13,554 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 22:51:13,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 22:51:13,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 22:51:13,556 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 22:51:13,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 22:51:13,558 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 22:51:13,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 22:51:13,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 22:51:13,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 22:51:13,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 22:51:13,567 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 22:51:13,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 22:51:13,567 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 22:51:13,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 22:51:13,569 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 22:51:13,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 22:51:13,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 22:51:13,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 22:51:13,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 22:51:13,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 22:51:13,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 22:51:13,574 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 22:51:13,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 22:51:13,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 22:51:13,598 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 22:51:13,599 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 22:51:13,599 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 22:51:13,599 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 22:51:13,600 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 22:51:13,600 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 22:51:13,600 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 22:51:13,600 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 22:51:13,601 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 22:51:13,601 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 22:51:13,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 22:51:13,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 22:51:13,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 22:51:13,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 22:51:13,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 22:51:13,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 22:51:13,602 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 22:51:13,602 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 22:51:13,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 22:51:13,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 22:51:13,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 22:51:13,603 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 22:51:13,603 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 22:51:13,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 22:51:13,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 22:51:13,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 22:51:13,604 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 22:51:13,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 22:51:13,605 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 22:51:13,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 22:51:13,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:13,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 22:51:13,606 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 22:51:13,606 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 22:51:13,606 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 22:51:13,607 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 22:51:13,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 22:51:13,654 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 22:51:13,659 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 22:51:13,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 22:51:13,661 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 22:51:13,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:13,953 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe8bb1575d [2018-04-09 22:51:14,139 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 22:51:14,139 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 22:51:14,139 INFO L168 CDTParser]: Scanning dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,150 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 22:51:14,150 INFO L215 ultiparseSymbolTable]: [2018-04-09 22:51:14,150 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 22:51:14,150 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,151 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 22:51:14,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__uid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fd_set in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_char in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____off64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_long in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__div_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__time_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__size_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_char in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__gid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ino_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__clock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ulong in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____mode_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_long in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____time_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_short in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_short in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__mode_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____dev_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____clock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____loff_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__id_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__dev_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____key_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__uint in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__loff_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ushort in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ino_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__register_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_int in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__off_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____gid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____off_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__Colour in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,160 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____pid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__key_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____timer_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,161 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__timer_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____id_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,162 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,163 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,163 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:14,180 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe8bb1575d [2018-04-09 22:51:14,184 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 22:51:14,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 22:51:14,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 22:51:14,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 22:51:14,195 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 22:51:14,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b6892e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14, skipping insertion in model container [2018-04-09 22:51:14,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,213 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:51:14,246 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:51:14,416 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:51:14,471 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:51:14,479 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-09 22:51:14,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14 WrapperNode [2018-04-09 22:51:14,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 22:51:14,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 22:51:14,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 22:51:14,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 22:51:14,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... [2018-04-09 22:51:14,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 22:51:14,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 22:51:14,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 22:51:14,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 22:51:14,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (1/1) ... No working directory specified, using /storage/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-09 22:51:14,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 22:51:14,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 22:51:14,725 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 22:51:14,725 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 22:51:14,725 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 22:51:14,725 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 22:51:14,725 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 22:51:14,725 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 22:51:14,725 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 22:51:14,725 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 22:51:14,726 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 22:51:14,726 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 22:51:14,726 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 22:51:14,726 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 22:51:14,726 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 22:51:14,726 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 22:51:14,727 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 22:51:14,727 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 22:51:14,727 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 22:51:14,727 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 22:51:14,727 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 22:51:14,727 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 22:51:14,728 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 22:51:14,728 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 22:51:14,728 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 22:51:14,728 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 22:51:14,728 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 22:51:14,728 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 22:51:14,729 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 22:51:14,730 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 22:51:14,730 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 22:51:14,730 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 22:51:14,730 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 22:51:14,730 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 22:51:14,730 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 22:51:14,730 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 22:51:14,731 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 22:51:14,732 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 22:51:14,733 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 22:51:14,734 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-09 22:51:14,734 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 22:51:14,734 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 22:51:14,734 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 22:51:14,734 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 22:51:14,734 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 22:51:14,734 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 22:51:14,735 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 22:51:14,736 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 22:51:14,737 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 22:51:14,738 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 22:51:14,739 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 22:51:14,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 22:51:14,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 22:51:14,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 22:51:14,740 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 22:51:15,387 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 22:51:15,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:51:15 BoogieIcfgContainer [2018-04-09 22:51:15,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 22:51:15,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 22:51:15,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 22:51:15,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 22:51:15,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 10:51:14" (1/3) ... [2018-04-09 22:51:15,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f14ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:51:15, skipping insertion in model container [2018-04-09 22:51:15,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:51:14" (2/3) ... [2018-04-09 22:51:15,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f14ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:51:15, skipping insertion in model container [2018-04-09 22:51:15,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:51:15" (3/3) ... [2018-04-09 22:51:15,393 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:51:15,400 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 22:51:15,407 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-04-09 22:51:15,443 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 22:51:15,443 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 22:51:15,444 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 22:51:15,444 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 22:51:15,444 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 22:51:15,444 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 22:51:15,444 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 22:51:15,444 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 22:51:15,444 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 22:51:15,444 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 22:51:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states. [2018-04-09 22:51:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-09 22:51:15,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:15,469 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:51:15,469 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:15,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1529905732, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:15,496 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:15,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:15,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:15,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:15,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:15,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:51:15,590 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-09 22:51:15,590 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:51:15,627 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:15,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:51:15,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:51:15,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:51:15,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:51:15,641 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 4 states. [2018-04-09 22:51:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:15,915 INFO L93 Difference]: Finished difference Result 409 states and 471 transitions. [2018-04-09 22:51:15,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 22:51:15,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-09 22:51:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:15,926 INFO L225 Difference]: With dead ends: 409 [2018-04-09 22:51:15,926 INFO L226 Difference]: Without dead ends: 218 [2018-04-09 22:51:15,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-09 22:51:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-09 22:51:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2018-04-09 22:51:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-09 22:51:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 197 transitions. [2018-04-09 22:51:15,985 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 197 transitions. Word has length 9 [2018-04-09 22:51:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:15,985 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 197 transitions. [2018-04-09 22:51:15,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:51:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 197 transitions. [2018-04-09 22:51:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-09 22:51:15,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:15,986 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:51:15,986 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1529905731, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:15,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:16,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:16,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:16,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:16,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:16,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:51:16,047 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-09 22:51:16,048 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:16,090 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-09 22:51:16,113 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:16,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:51:16,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:51:16,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:51:16,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:51:16,115 INFO L87 Difference]: Start difference. First operand 190 states and 197 transitions. Second operand 6 states. [2018-04-09 22:51:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:16,386 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2018-04-09 22:51:16,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 22:51:16,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-09 22:51:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:16,388 INFO L225 Difference]: With dead ends: 190 [2018-04-09 22:51:16,389 INFO L226 Difference]: Without dead ends: 186 [2018-04-09 22:51:16,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:51:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-09 22:51:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-04-09 22:51:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-09 22:51:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 192 transitions. [2018-04-09 22:51:16,404 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 192 transitions. Word has length 9 [2018-04-09 22:51:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:16,405 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 192 transitions. [2018-04-09 22:51:16,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:51:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 192 transitions. [2018-04-09 22:51:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-09 22:51:16,406 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:16,406 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:51:16,406 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1847144014, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:16,418 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:16,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:16,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:16,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:16,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:16,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:51:16,461 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-09 22:51:16,461 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:16,468 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-09 22:51:16,489 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:16,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:51:16,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:51:16,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:51:16,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:51:16,490 INFO L87 Difference]: Start difference. First operand 186 states and 192 transitions. Second operand 4 states. [2018-04-09 22:51:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:16,618 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-04-09 22:51:16,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:51:16,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-09 22:51:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:16,619 INFO L225 Difference]: With dead ends: 209 [2018-04-09 22:51:16,620 INFO L226 Difference]: Without dead ends: 201 [2018-04-09 22:51:16,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-09 22:51:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-09 22:51:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2018-04-09 22:51:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-09 22:51:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2018-04-09 22:51:16,633 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 14 [2018-04-09 22:51:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:16,633 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2018-04-09 22:51:16,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:51:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2018-04-09 22:51:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-09 22:51:16,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:16,634 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:51:16,634 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1847144013, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:16,642 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:16,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:16,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 6 treesize of output 5 [2018-04-09 22:51:16,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:16,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:16,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:51:16,760 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-09 22:51:16,760 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:16,783 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-09 22:51:16,804 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:16,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:51:16,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:51:16,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:51:16,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:51:16,805 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand 6 states. [2018-04-09 22:51:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:16,970 INFO L93 Difference]: Finished difference Result 209 states and 215 transitions. [2018-04-09 22:51:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:51:16,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-09 22:51:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:16,972 INFO L225 Difference]: With dead ends: 209 [2018-04-09 22:51:16,972 INFO L226 Difference]: Without dead ends: 201 [2018-04-09 22:51:16,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:51:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-09 22:51:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 188. [2018-04-09 22:51:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-09 22:51:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2018-04-09 22:51:16,984 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 14 [2018-04-09 22:51:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:16,984 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2018-04-09 22:51:16,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:51:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2018-04-09 22:51:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-09 22:51:16,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:16,985 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] [2018-04-09 22:51:16,986 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1495805674, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:16,995 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:17,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:17,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:17,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:17,059 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-09 22:51:17,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:17,069 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-09 22:51:17,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-09 22:51:17,097 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-09 22:51:17,098 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:17,128 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-09 22:51:17,158 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:17,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 22:51:17,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 22:51:17,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 22:51:17,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:51:17,159 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand 7 states. [2018-04-09 22:51:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:17,381 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-04-09 22:51:17,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:51:17,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-04-09 22:51:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:17,383 INFO L225 Difference]: With dead ends: 207 [2018-04-09 22:51:17,383 INFO L226 Difference]: Without dead ends: 191 [2018-04-09 22:51:17,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-04-09 22:51:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-09 22:51:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-04-09 22:51:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 22:51:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 185 transitions. [2018-04-09 22:51:17,393 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 185 transitions. Word has length 23 [2018-04-09 22:51:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:17,393 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 185 transitions. [2018-04-09 22:51:17,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 22:51:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2018-04-09 22:51:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-09 22:51:17,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:17,394 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] [2018-04-09 22:51:17,394 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1495805675, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:17,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:17,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:17,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:17,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 22:51:17,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:17,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:17,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:17,464 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-09 22:51:17,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:17,470 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-09 22:51:17,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-09 22:51:17,479 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-09 22:51:17,480 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:17,547 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-09 22:51:17,569 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:17,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 22:51:17,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:51:17,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:51:17,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:51:17,570 INFO L87 Difference]: Start difference. First operand 176 states and 185 transitions. Second operand 8 states. [2018-04-09 22:51:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:17,927 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-04-09 22:51:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 22:51:17,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-04-09 22:51:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:17,928 INFO L225 Difference]: With dead ends: 219 [2018-04-09 22:51:17,928 INFO L226 Difference]: Without dead ends: 210 [2018-04-09 22:51:17,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:51:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-09 22:51:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2018-04-09 22:51:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-09 22:51:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-04-09 22:51:17,934 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 23 [2018-04-09 22:51:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:17,934 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-04-09 22:51:17,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:51:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-04-09 22:51:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 22:51:17,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:17,935 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:51:17,935 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1344791026, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:17,941 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:17,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:17,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:17,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:17,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:17,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:51:17,990 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-09 22:51:17,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-09 22:51:17,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:17,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,001 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-09 22:51:18,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:18,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,008 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-09 22:51:18,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-09 22:51:18,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 22:51:18,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 22:51:18,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 22:51:18,027 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-09 22:51:18,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,030 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-09 22:51:18,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-09 22:51:18,036 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-09 22:51:18,036 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:18,061 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-09 22:51:18,083 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:18,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 22:51:18,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:51:18,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:51:18,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:51:18,084 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 8 states. [2018-04-09 22:51:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:18,397 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2018-04-09 22:51:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 22:51:18,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-09 22:51:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:18,399 INFO L225 Difference]: With dead ends: 282 [2018-04-09 22:51:18,399 INFO L226 Difference]: Without dead ends: 281 [2018-04-09 22:51:18,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-04-09 22:51:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-09 22:51:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 173. [2018-04-09 22:51:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-09 22:51:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-04-09 22:51:18,407 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 25 [2018-04-09 22:51:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:18,407 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-04-09 22:51:18,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:51:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-04-09 22:51:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 22:51:18,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:18,408 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] [2018-04-09 22:51:18,408 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1344791027, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:18,415 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:18,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:18,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 6 treesize of output 5 [2018-04-09 22:51:18,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:51:18,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-09 22:51:18,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-09 22:51:18,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,482 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-09 22:51:18,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 22:51:18,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 22:51:18,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 22:51:18,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:18,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 22:51:18,495 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-09 22:51:18,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:18,499 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-09 22:51:18,520 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:18,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 22:51:18,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:51:18,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:51:18,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:51:18,521 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 5 states. [2018-04-09 22:51:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:18,930 INFO L93 Difference]: Finished difference Result 245 states and 263 transitions. [2018-04-09 22:51:18,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:51:18,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-09 22:51:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:18,932 INFO L225 Difference]: With dead ends: 245 [2018-04-09 22:51:18,932 INFO L226 Difference]: Without dead ends: 244 [2018-04-09 22:51:18,933 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-09 22:51:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-09 22:51:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 172. [2018-04-09 22:51:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-09 22:51:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-04-09 22:51:18,938 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 25 [2018-04-09 22:51:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:18,939 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 182 transitions. [2018-04-09 22:51:18,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:51:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2018-04-09 22:51:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-09 22:51:18,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:18,940 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-09 22:51:18,940 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:18,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2113019045, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:18,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:18,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:51:18,975 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:18,996 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-09 22:51:19,019 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:19,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:51:19,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:51:19,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:51:19,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:51:19,020 INFO L87 Difference]: Start difference. First operand 172 states and 182 transitions. Second operand 4 states. [2018-04-09 22:51:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:19,146 INFO L93 Difference]: Finished difference Result 258 states and 274 transitions. [2018-04-09 22:51:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:51:19,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-09 22:51:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:19,147 INFO L225 Difference]: With dead ends: 258 [2018-04-09 22:51:19,147 INFO L226 Difference]: Without dead ends: 255 [2018-04-09 22:51:19,148 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-09 22:51:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-09 22:51:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 182. [2018-04-09 22:51:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-09 22:51:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-04-09 22:51:19,158 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 28 [2018-04-09 22:51:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:19,158 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-04-09 22:51:19,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:51:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-04-09 22:51:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-09 22:51:19,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:19,159 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:51:19,159 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1076965014, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:19,168 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:19,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:19,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:19,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:19,207 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-09 22:51:19,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 22:51:19,235 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-09 22:51:19,238 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-09 22:51:19,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,248 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-09 22:51:19,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-09 22:51:19,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-09 22:51:19,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 14 treesize of output 13 [2018-04-09 22:51:19,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,304 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-09 22:51:19,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-09 22:51:19,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-09 22:51:19,324 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-09 22:51:19,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,330 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-09 22:51:19,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:19,339 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-09 22:51:19,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-09 22:51:19,383 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-09 22:51:19,383 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:19,444 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-09 22:51:19,465 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:19,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2018-04-09 22:51:19,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 22:51:19,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 22:51:19,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-09 22:51:19,466 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 14 states. [2018-04-09 22:51:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:20,059 INFO L93 Difference]: Finished difference Result 289 states and 310 transitions. [2018-04-09 22:51:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 22:51:20,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-04-09 22:51:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:20,062 INFO L225 Difference]: With dead ends: 289 [2018-04-09 22:51:20,062 INFO L226 Difference]: Without dead ends: 288 [2018-04-09 22:51:20,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2018-04-09 22:51:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-09 22:51:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 181. [2018-04-09 22:51:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-09 22:51:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 191 transitions. [2018-04-09 22:51:20,071 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 191 transitions. Word has length 30 [2018-04-09 22:51:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:20,072 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 191 transitions. [2018-04-09 22:51:20,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 22:51:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 191 transitions. [2018-04-09 22:51:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-09 22:51:20,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:20,073 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:51:20,073 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1076965013, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:20,082 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:20,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:20,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:51:20,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:20,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:20,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, 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-09 22:51:20,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 22:51:20,129 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-09 22:51:20,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:20,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,139 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-09 22:51:20,140 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-09 22:51:20,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,147 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-09 22:51:20,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-09 22:51:20,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 29 treesize of output 30 [2018-04-09 22:51:20,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:20,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-04-09 22:51:20,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:20,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,239 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-09 22:51:20,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-09 22:51:20,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-09 22:51:20,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-09 22:51:20,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,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 7 treesize of output 1 [2018-04-09 22:51:20,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-09 22:51:20,294 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-09 22:51:20,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,300 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-09 22:51:20,300 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,303 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,308 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-09 22:51:20,308 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-09 22:51:20,330 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-09 22:51:20,331 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:20,699 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-09 22:51:20,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:51:20,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,722 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 50 treesize of output 46 [2018-04-09 22:51:20,724 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 46 treesize of output 37 [2018-04-09 22:51:20,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,735 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-09 22:51:20,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 9 treesize of output 8 [2018-04-09 22:51:20,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,769 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 17 [2018-04-09 22:51:20,771 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 6 treesize of output 1 [2018-04-09 22:51:20,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,774 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,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 16 treesize of output 12 [2018-04-09 22:51:20,776 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 12 treesize of output 3 [2018-04-09 22:51:20,777 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,778 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:51:20,808 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-09 22:51:20,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:51:20,832 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,850 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 17 [2018-04-09 22:51:20,852 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 6 treesize of output 1 [2018-04-09 22:51:20,852 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,855 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,857 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 20 treesize of output 16 [2018-04-09 22:51:20,859 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-09 22:51:20,859 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,861 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:20,872 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:51:20,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 22:51:20,901 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:101, output treesize:33 [2018-04-09 22:51:20,946 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-09 22:51:20,967 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:20,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-09 22:51:20,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 22:51:20,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 22:51:20,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-09 22:51:20,968 INFO L87 Difference]: Start difference. First operand 181 states and 191 transitions. Second operand 18 states. [2018-04-09 22:51:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:21,817 INFO L93 Difference]: Finished difference Result 245 states and 259 transitions. [2018-04-09 22:51:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-09 22:51:21,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-04-09 22:51:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:21,818 INFO L225 Difference]: With dead ends: 245 [2018-04-09 22:51:21,819 INFO L226 Difference]: Without dead ends: 242 [2018-04-09 22:51:21,819 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-04-09 22:51:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-09 22:51:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 178. [2018-04-09 22:51:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-09 22:51:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 188 transitions. [2018-04-09 22:51:21,826 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 188 transitions. Word has length 30 [2018-04-09 22:51:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:21,826 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 188 transitions. [2018-04-09 22:51:21,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 22:51:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 188 transitions. [2018-04-09 22:51:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 22:51:21,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:21,827 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] [2018-04-09 22:51:21,827 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1715684552, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:21,838 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:21,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:21,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:21,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:21,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:21,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:51:21,898 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-09 22:51:21,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:21,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:21,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:21,906 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-09 22:51:21,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 22:51:21,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 22:51:21,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 22:51:21,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:21,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:21,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:21,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 22:51:21,923 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-09 22:51:21,923 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:21,927 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-09 22:51:21,960 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:21,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 22:51:21,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:51:21,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:51:21,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:51:21,960 INFO L87 Difference]: Start difference. First operand 178 states and 188 transitions. Second operand 5 states. [2018-04-09 22:51:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:22,179 INFO L93 Difference]: Finished difference Result 278 states and 296 transitions. [2018-04-09 22:51:22,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:51:22,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-09 22:51:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:22,181 INFO L225 Difference]: With dead ends: 278 [2018-04-09 22:51:22,181 INFO L226 Difference]: Without dead ends: 277 [2018-04-09 22:51:22,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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-09 22:51:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-09 22:51:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 177. [2018-04-09 22:51:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-09 22:51:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 187 transitions. [2018-04-09 22:51:22,187 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 187 transitions. Word has length 38 [2018-04-09 22:51:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:22,188 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 187 transitions. [2018-04-09 22:51:22,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:51:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 187 transitions. [2018-04-09 22:51:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 22:51:22,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:22,189 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] [2018-04-09 22:51:22,189 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1715684551, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:22,197 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:22,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:22,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:22,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:51:22,231 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-09 22:51:22,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:51:22,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,242 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-09 22:51:22,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:22,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,249 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-09 22:51:22,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-09 22:51:22,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 22:51:22,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 22:51:22,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 22:51:22,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, 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-09 22:51:22,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,272 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-09 22:51:22,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-09 22:51:22,278 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-09 22:51:22,278 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:22,312 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-09 22:51:22,345 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:22,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 22:51:22,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:51:22,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:51:22,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:51:22,346 INFO L87 Difference]: Start difference. First operand 177 states and 187 transitions. Second operand 8 states. [2018-04-09 22:51:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:22,586 INFO L93 Difference]: Finished difference Result 313 states and 332 transitions. [2018-04-09 22:51:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 22:51:22,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-04-09 22:51:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:22,588 INFO L225 Difference]: With dead ends: 313 [2018-04-09 22:51:22,588 INFO L226 Difference]: Without dead ends: 312 [2018-04-09 22:51:22,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-04-09 22:51:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-09 22:51:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 176. [2018-04-09 22:51:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 22:51:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-09 22:51:22,595 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 38 [2018-04-09 22:51:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:22,596 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-09 22:51:22,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:51:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-09 22:51:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 22:51:22,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:22,597 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] [2018-04-09 22:51:22,597 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash -11351577, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:22,613 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:22,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:22,658 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-09 22:51:22,658 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:22,673 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-09 22:51:22,709 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:22,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:51:22,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 22:51:22,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 22:51:22,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 22:51:22,710 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 3 states. [2018-04-09 22:51:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:22,819 INFO L93 Difference]: Finished difference Result 241 states and 254 transitions. [2018-04-09 22:51:22,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:51:22,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-04-09 22:51:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:22,821 INFO L225 Difference]: With dead ends: 241 [2018-04-09 22:51:22,821 INFO L226 Difference]: Without dead ends: 184 [2018-04-09 22:51:22,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 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-09 22:51:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-09 22:51:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176. [2018-04-09 22:51:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 22:51:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 185 transitions. [2018-04-09 22:51:22,830 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 185 transitions. Word has length 40 [2018-04-09 22:51:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:22,831 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 185 transitions. [2018-04-09 22:51:22,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 22:51:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2018-04-09 22:51:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-09 22:51:22,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:22,832 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] [2018-04-09 22:51:22,832 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash 893584142, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:22,842 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:22,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:22,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 22:51:22,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-09 22:51:22,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:51:22,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:22,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-09 22:51:22,972 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-09 22:51:22,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:22,975 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-09 22:51:22,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:22,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-09 22:51:23,049 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 36 treesize of output 26 [2018-04-09 22:51:23,063 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 26 treesize of output 10 [2018-04-09 22:51:23,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:23,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:23,091 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-09 22:51:23,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-04-09 22:51:23,130 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-09 22:51:23,130 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:25,242 WARN L1011 $PredicateComparison]: unable to prove that (and (or (= 0 c_main_~null~0.offset) (forall ((|v_main_#t~malloc1.base_5| Int)) (= 1 (select (store |c_#valid| |v_main_#t~malloc1.base_5| 1) c_main_~null~0.base)))) (forall ((v_prenex_5 Int)) (or (= 1 (select (store |c_#valid| v_prenex_5 1) c_main_~null~0.base)) (= c_main_~null~0.base v_prenex_5)))) is different from false [2018-04-09 22:51:25,254 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-09 22:51:25,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:51:25,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-04-09 22:51:25,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 22:51:25,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 22:51:25,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2018-04-09 22:51:25,275 INFO L87 Difference]: Start difference. First operand 176 states and 185 transitions. Second operand 21 states. [2018-04-09 22:51:27,196 WARN L151 SmtUtils]: Spent 1888ms on a formula simplification. DAG size of input: 24 DAG size of output 11 [2018-04-09 22:51:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:28,253 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2018-04-09 22:51:28,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-09 22:51:28,254 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-04-09 22:51:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:28,255 INFO L225 Difference]: With dead ends: 274 [2018-04-09 22:51:28,255 INFO L226 Difference]: Without dead ends: 273 [2018-04-09 22:51:28,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=723, Invalid=1632, Unknown=1, NotChecked=94, Total=2450 [2018-04-09 22:51:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-09 22:51:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2018-04-09 22:51:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-09 22:51:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 202 transitions. [2018-04-09 22:51:28,264 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 202 transitions. Word has length 42 [2018-04-09 22:51:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:28,265 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 202 transitions. [2018-04-09 22:51:28,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 22:51:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 202 transitions. [2018-04-09 22:51:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-09 22:51:28,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:28,266 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] [2018-04-09 22:51:28,266 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash 893584143, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:28,287 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:28,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:28,332 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-09 22:51:28,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:28,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,373 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-09 22:51:28,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:28,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-09 22:51:28,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 22:51:28,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:28,394 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-09 22:51:28,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,408 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-09 22:51:28,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:28,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, 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-09 22:51:28,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-09 22:51:28,456 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-09 22:51:28,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:28,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 22:51:28,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,470 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-09 22:51:28,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:28,473 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-09 22:51:28,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,480 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-09 22:51:28,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-09 22:51:28,501 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-09 22:51:28,501 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:28,541 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-09 22:51:28,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:51:28,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-04-09 22:51:28,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:51:28,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:51:28,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:51:28,578 INFO L87 Difference]: Start difference. First operand 190 states and 202 transitions. Second operand 8 states. [2018-04-09 22:51:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:28,900 INFO L93 Difference]: Finished difference Result 338 states and 357 transitions. [2018-04-09 22:51:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 22:51:28,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-09 22:51:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:28,901 INFO L225 Difference]: With dead ends: 338 [2018-04-09 22:51:28,902 INFO L226 Difference]: Without dead ends: 254 [2018-04-09 22:51:28,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-04-09 22:51:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-09 22:51:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 189. [2018-04-09 22:51:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-09 22:51:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2018-04-09 22:51:28,908 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 42 [2018-04-09 22:51:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:28,909 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2018-04-09 22:51:28,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:51:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2018-04-09 22:51:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 22:51:28,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:28,909 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-09 22:51:28,909 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1736098048, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:28,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:28,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:28,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:28,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:28,947 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-09 22:51:28,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 22:51:28,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 22:51:28,961 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-09 22:51:28,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,967 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-09 22:51:28,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-09 22:51:28,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-09 22:51:28,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:28,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:28,995 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-09 22:51:28,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-09 22:51:29,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-09 22:51:29,011 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-09 22:51:29,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,016 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-09 22:51:29,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,022 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-09 22:51:29,022 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-09 22:51:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:51:29,042 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:29,081 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-09 22:51:29,102 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:29,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2018-04-09 22:51:29,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 22:51:29,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 22:51:29,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-09 22:51:29,103 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand 13 states. [2018-04-09 22:51:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:29,610 INFO L93 Difference]: Finished difference Result 317 states and 335 transitions. [2018-04-09 22:51:29,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 22:51:29,611 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-04-09 22:51:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:29,612 INFO L225 Difference]: With dead ends: 317 [2018-04-09 22:51:29,613 INFO L226 Difference]: Without dead ends: 316 [2018-04-09 22:51:29,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-04-09 22:51:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-09 22:51:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 188. [2018-04-09 22:51:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-09 22:51:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 198 transitions. [2018-04-09 22:51:29,624 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 198 transitions. Word has length 43 [2018-04-09 22:51:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:29,624 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 198 transitions. [2018-04-09 22:51:29,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 22:51:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 198 transitions. [2018-04-09 22:51:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 22:51:29,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:29,625 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-09 22:51:29,625 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1736098047, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:29,650 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:29,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:29,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:29,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:29,705 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-09 22:51:29,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,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, 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-09 22:51:29,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 22:51:29,728 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-09 22:51:29,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:29,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,745 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-09 22:51:29,748 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-09 22:51:29,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,757 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-09 22:51:29,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-09 22:51:29,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-09 22:51:29,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:29,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-04-09 22:51:29,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:29,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,816 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-09 22:51:29,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-09 22:51:29,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-09 22:51:29,838 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-09 22:51:29,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-09 22:51:29,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-09 22:51:29,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 22:51:29,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 22:51:29,876 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:29,882 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-09 22:51:29,882 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-09 22:51:29,899 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-09 22:51:29,899 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:30,061 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-09 22:51:30,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:51:30,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,093 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 50 treesize of output 46 [2018-04-09 22:51:30,095 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 46 treesize of output 37 [2018-04-09 22:51:30,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,107 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-09 22:51:30,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:51:30,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,135 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 17 [2018-04-09 22:51:30,137 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 6 treesize of output 1 [2018-04-09 22:51:30,137 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,142 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-09 22:51:30,144 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 12 treesize of output 3 [2018-04-09 22:51:30,144 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,146 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,157 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:51:30,178 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-09 22:51:30,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:51:30,196 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,210 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 17 [2018-04-09 22:51:30,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-09 22:51:30,212 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,215 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,217 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 20 treesize of output 16 [2018-04-09 22:51:30,219 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-09 22:51:30,219 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,221 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,233 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:51:30,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 22:51:30,261 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:101, output treesize:33 [2018-04-09 22:51:30,305 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-09 22:51:30,339 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:30,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-09 22:51:30,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 22:51:30,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 22:51:30,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-09 22:51:30,341 INFO L87 Difference]: Start difference. First operand 188 states and 198 transitions. Second operand 16 states. [2018-04-09 22:51:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:30,935 INFO L93 Difference]: Finished difference Result 238 states and 250 transitions. [2018-04-09 22:51:30,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 22:51:30,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-09 22:51:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:30,937 INFO L225 Difference]: With dead ends: 238 [2018-04-09 22:51:30,937 INFO L226 Difference]: Without dead ends: 236 [2018-04-09 22:51:30,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-04-09 22:51:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-09 22:51:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 186. [2018-04-09 22:51:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-09 22:51:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 196 transitions. [2018-04-09 22:51:30,945 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 196 transitions. Word has length 43 [2018-04-09 22:51:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:30,945 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 196 transitions. [2018-04-09 22:51:30,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 22:51:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 196 transitions. [2018-04-09 22:51:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-09 22:51:30,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:30,946 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] [2018-04-09 22:51:30,946 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1286059621, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:30,952 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:30,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:30,976 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-09 22:51:30,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-09 22:51:30,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-09 22:51:30,984 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-09 22:51:30,984 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:30,997 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:51:30,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:30,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:1 [2018-04-09 22:51:31,008 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-09 22:51:31,030 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:31,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-09 22:51:31,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:51:31,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:51:31,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:51:31,031 INFO L87 Difference]: Start difference. First operand 186 states and 196 transitions. Second operand 6 states. [2018-04-09 22:51:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:31,121 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2018-04-09 22:51:31,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:51:31,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-04-09 22:51:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:31,122 INFO L225 Difference]: With dead ends: 278 [2018-04-09 22:51:31,122 INFO L226 Difference]: Without dead ends: 193 [2018-04-09 22:51:31,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:51:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-09 22:51:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2018-04-09 22:51:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-09 22:51:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 192 transitions. [2018-04-09 22:51:31,129 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 192 transitions. Word has length 44 [2018-04-09 22:51:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:31,129 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 192 transitions. [2018-04-09 22:51:31,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:51:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 192 transitions. [2018-04-09 22:51:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-09 22:51:31,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:31,130 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] [2018-04-09 22:51:31,130 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1817729817, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:31,142 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:31,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:31,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:31,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:31,176 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-09 22:51:31,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 22:51:31,189 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-09 22:51:31,189 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:31,211 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-09 22:51:31,246 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:31,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-09 22:51:31,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:51:31,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:51:31,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:51:31,247 INFO L87 Difference]: Start difference. First operand 184 states and 192 transitions. Second operand 6 states. [2018-04-09 22:51:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:31,350 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2018-04-09 22:51:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:51:31,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-04-09 22:51:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:31,351 INFO L225 Difference]: With dead ends: 230 [2018-04-09 22:51:31,351 INFO L226 Difference]: Without dead ends: 223 [2018-04-09 22:51:31,352 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:51:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-09 22:51:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 189. [2018-04-09 22:51:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-09 22:51:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 197 transitions. [2018-04-09 22:51:31,360 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 197 transitions. Word has length 48 [2018-04-09 22:51:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:31,361 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 197 transitions. [2018-04-09 22:51:31,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:51:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2018-04-09 22:51:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-09 22:51:31,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:31,362 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-09 22:51:31,362 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash -759384295, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:31,372 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:31,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:31,402 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-09 22:51:31,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:31,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-04-09 22:51:31,421 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-09 22:51:31,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 22:51:31,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-09 22:51:31,437 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-09 22:51:31,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:31,495 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-09 22:51:31,516 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:51:31,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 22:51:31,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:51:31,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:51:31,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:51:31,517 INFO L87 Difference]: Start difference. First operand 189 states and 197 transitions. Second operand 6 states. [2018-04-09 22:51:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:31,582 INFO L93 Difference]: Finished difference Result 323 states and 337 transitions. [2018-04-09 22:51:31,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:51:31,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-04-09 22:51:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:31,584 INFO L225 Difference]: With dead ends: 323 [2018-04-09 22:51:31,584 INFO L226 Difference]: Without dead ends: 277 [2018-04-09 22:51:31,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:51:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-09 22:51:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 260. [2018-04-09 22:51:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-09 22:51:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 279 transitions. [2018-04-09 22:51:31,596 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 279 transitions. Word has length 53 [2018-04-09 22:51:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:31,597 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 279 transitions. [2018-04-09 22:51:31,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:51:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 279 transitions. [2018-04-09 22:51:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 22:51:31,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:31,598 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] [2018-04-09 22:51:31,598 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1270647918, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:31,610 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:31,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:31,642 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-09 22:51:31,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:31,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,651 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-09 22:51:31,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:31,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-09 22:51:31,768 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-09 22:51:31,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:31,771 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-09 22:51:31,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,780 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-09 22:51:31,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:31,782 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-09 22:51:31,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:31,787 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-09 22:51:31,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-09 22:51:31,816 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-09 22:51:31,816 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:31,904 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-09 22:51:31,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:51:31,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-04-09 22:51:31,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 22:51:31,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 22:51:31,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-09 22:51:31,928 INFO L87 Difference]: Start difference. First operand 260 states and 279 transitions. Second operand 14 states. [2018-04-09 22:51:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:32,507 INFO L93 Difference]: Finished difference Result 385 states and 409 transitions. [2018-04-09 22:51:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 22:51:32,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-04-09 22:51:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:32,510 INFO L225 Difference]: With dead ends: 385 [2018-04-09 22:51:32,510 INFO L226 Difference]: Without dead ends: 344 [2018-04-09 22:51:32,510 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-04-09 22:51:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-09 22:51:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 286. [2018-04-09 22:51:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-09 22:51:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 308 transitions. [2018-04-09 22:51:32,523 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 308 transitions. Word has length 56 [2018-04-09 22:51:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:32,523 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 308 transitions. [2018-04-09 22:51:32,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 22:51:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 308 transitions. [2018-04-09 22:51:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 22:51:32,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:32,524 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-09 22:51:32,524 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash -538502597, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:32,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:32,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:32,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:32,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 22:51:32,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:32,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:32,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:32,582 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-09 22:51:32,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:32,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:32,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-09 22:51:32,641 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-09 22:51:32,642 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-09 22:51:32,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:32,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:32,651 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-09 22:51:32,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:33 [2018-04-09 22:51:32,664 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 18 treesize of output 14 [2018-04-09 22:51:32,665 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 14 treesize of output 10 [2018-04-09 22:51:32,666 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-09 22:51:32,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:51:32,674 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-09 22:51:32,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-09 22:51:32,744 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-09 22:51:32,744 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:32,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 22:51:32,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:32,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:32,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-09 22:51:32,835 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-09 22:51:32,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:51:32,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-04-09 22:51:32,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 22:51:32,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 22:51:32,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-04-09 22:51:32,856 INFO L87 Difference]: Start difference. First operand 286 states and 308 transitions. Second operand 13 states. [2018-04-09 22:51:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:33,245 INFO L93 Difference]: Finished difference Result 312 states and 334 transitions. [2018-04-09 22:51:33,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 22:51:33,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-04-09 22:51:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:33,246 INFO L225 Difference]: With dead ends: 312 [2018-04-09 22:51:33,246 INFO L226 Difference]: Without dead ends: 311 [2018-04-09 22:51:33,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-04-09 22:51:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-09 22:51:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 285. [2018-04-09 22:51:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-09 22:51:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 306 transitions. [2018-04-09 22:51:33,255 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 306 transitions. Word has length 58 [2018-04-09 22:51:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:33,255 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 306 transitions. [2018-04-09 22:51:33,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 22:51:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 306 transitions. [2018-04-09 22:51:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 22:51:33,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:33,256 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] [2018-04-09 22:51:33,256 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:33,256 INFO L82 PathProgramCache]: Analyzing trace with hash -934027680, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:33,272 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:33,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:33,447 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-09 22:51:33,447 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:33,610 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-09 22:51:33,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:51:33,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-09 22:51:33,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 22:51:33,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 22:51:33,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=217, Unknown=8, NotChecked=0, Total=272 [2018-04-09 22:51:33,632 INFO L87 Difference]: Start difference. First operand 285 states and 306 transitions. Second operand 17 states. [2018-04-09 22:51:34,017 WARN L1011 $PredicateComparison]: unable to prove that (and (or (= 0 c_main_~null~0.offset) (forall ((v_prenex_10 Int)) (or (not (= (select |c_#valid| v_prenex_10) 0)) (= (store (store |c_#valid| v_prenex_10 0) c_main_~null~0.base 0) |c_old(#valid)|)))) (forall ((|v_main_#t~malloc1.base_7| Int)) (or (= (store (store |c_#valid| |v_main_#t~malloc1.base_7| 0) c_main_~null~0.base 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc1.base_7|) 0)) (= c_main_~null~0.base |v_main_#t~malloc1.base_7|))) (= (store (store |c_#valid| c_main_~list~0.base 0) c_main_~null~0.base 0) |c_old(#valid)|) (or (= (store (store |c_#valid| |c_main_#t~malloc1.base| 0) c_main_~null~0.base 0) |c_old(#valid)|) (and (= |c_main_#t~malloc1.base| c_main_~null~0.base) (= |c_main_#t~malloc1.offset| c_main_~null~0.offset))) (exists ((main_~null~0.base Int) (main_~list~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~null~0.base 1))) (and (= (store (store .cse0 main_~list~0.base 0) main_~null~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~null~0.base) 0) (= (select .cse0 main_~list~0.base) 0))))) is different from false [2018-04-09 22:51:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:34,133 INFO L93 Difference]: Finished difference Result 307 states and 327 transitions. [2018-04-09 22:51:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 22:51:34,134 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-04-09 22:51:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:34,135 INFO L225 Difference]: With dead ends: 307 [2018-04-09 22:51:34,135 INFO L226 Difference]: Without dead ends: 266 [2018-04-09 22:51:34,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=334, Unknown=9, NotChecked=38, Total=462 [2018-04-09 22:51:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-09 22:51:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-04-09 22:51:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-09 22:51:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 284 transitions. [2018-04-09 22:51:34,144 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 284 transitions. Word has length 60 [2018-04-09 22:51:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:34,144 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 284 transitions. [2018-04-09 22:51:34,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 22:51:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 284 transitions. [2018-04-09 22:51:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-09 22:51:34,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:34,145 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] [2018-04-09 22:51:34,145 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1698069980, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:34,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:34,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:34,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:34,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:34,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, 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-09 22:51:34,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 22:51:34,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-09 22:51:34,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, 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-09 22:51:34,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,220 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-09 22:51:34,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-09 22:51:34,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:34,252 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 30 treesize of output 34 [2018-04-09 22:51:34,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:34,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,268 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-09 22:51:34,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-09 22:51:34,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 50 treesize of output 40 [2018-04-09 22:51:34,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-09 22:51:34,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:34,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:34,365 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 2 xjuncts. [2018-04-09 22:51:34,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:50 [2018-04-09 22:51:34,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-09 22:51:34,413 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-09 22:51:34,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-04-09 22:51:34,458 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-09 22:51:34,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:34,487 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 24 treesize of output 19 [2018-04-09 22:51:34,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:34,489 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-09 22:51:34,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2018-04-09 22:51:37,838 WARN L148 SmtUtils]: Spent 492ms on a formula simplification that was a NOOP. DAG size: 23 [2018-04-09 22:51:39,883 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 87 [2018-04-09 22:51:39,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:51:39,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:39,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58 [2018-04-09 22:51:39,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-09 22:51:39,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:39,973 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 41 treesize of output 40 [2018-04-09 22:51:39,973 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:39,975 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 41 treesize of output 40 [2018-04-09 22:51:39,975 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:39,976 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 42 treesize of output 41 [2018-04-09 22:51:39,977 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,071 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 36 treesize of output 33 [2018-04-09 22:51:40,071 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,074 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 37 treesize of output 34 [2018-04-09 22:51:40,075 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,077 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 34 treesize of output 33 [2018-04-09 22:51:40,078 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2018-04-09 22:51:40,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-04-09 22:51:40,195 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,209 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 23 treesize of output 21 [2018-04-09 22:51:40,210 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 22:51:40,222 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,234 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 28 treesize of output 21 [2018-04-09 22:51:40,234 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 22:51:40,248 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,257 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:40,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-09 22:51:40,264 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 8 treesize of output 1 [2018-04-09 22:51:40,265 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,272 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 18 treesize of output 8 [2018-04-09 22:51:40,272 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,277 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 44 [2018-04-09 22:51:40,293 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 34 treesize of output 32 [2018-04-09 22:51:40,294 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,331 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 31 treesize of output 31 [2018-04-09 22:51:40,332 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:40,373 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 23 [2018-04-09 22:51:40,374 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,400 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 23 treesize of output 16 [2018-04-09 22:51:40,401 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,424 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 18 treesize of output 10 [2018-04-09 22:51:40,425 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,466 INFO L267 ElimStorePlain]: Start of recursive call 21: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:40,547 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 33 treesize of output 35 [2018-04-09 22:51:40,550 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 30 treesize of output 16 [2018-04-09 22:51:40,550 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-09 22:51:40,566 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,588 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 16 treesize of output 14 [2018-04-09 22:51:40,588 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,599 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:40,600 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 34 treesize of output 30 [2018-04-09 22:51:40,603 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 1 [2018-04-09 22:51:40,603 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,606 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,608 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 33 treesize of output 30 [2018-04-09 22:51:40,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, 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 1 [2018-04-09 22:51:40,611 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,617 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 5 treesize of output 3 [2018-04-09 22:51:40,617 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,619 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:40,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-09 22:51:40,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-09 22:51:40,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-09 22:51:40,712 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 4 variables, input treesize:157, output treesize:33 [2018-04-09 22:51:40,765 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-09 22:51:40,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:51:40,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-04-09 22:51:40,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-09 22:51:40,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-09 22:51:40,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=439, Unknown=2, NotChecked=0, Total=506 [2018-04-09 22:51:40,786 INFO L87 Difference]: Start difference. First operand 264 states and 284 transitions. Second operand 23 states. [2018-04-09 22:51:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:41,893 INFO L93 Difference]: Finished difference Result 389 states and 414 transitions. [2018-04-09 22:51:41,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 22:51:41,894 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-04-09 22:51:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:41,895 INFO L225 Difference]: With dead ends: 389 [2018-04-09 22:51:41,895 INFO L226 Difference]: Without dead ends: 388 [2018-04-09 22:51:41,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=285, Invalid=1119, Unknown=2, NotChecked=0, Total=1406 [2018-04-09 22:51:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-09 22:51:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 316. [2018-04-09 22:51:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-09 22:51:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 340 transitions. [2018-04-09 22:51:41,911 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 340 transitions. Word has length 72 [2018-04-09 22:51:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:41,912 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 340 transitions. [2018-04-09 22:51:41,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-09 22:51:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 340 transitions. [2018-04-09 22:51:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-09 22:51:41,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:41,913 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] [2018-04-09 22:51:41,913 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:41,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1698069979, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:41,937 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:41,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:42,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43 [2018-04-09 22:51:42,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-04-09 22:51:42,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-04-09 22:51:42,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-04-09 22:51:42,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2018-04-09 22:51:42,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:42,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:42,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:42,159 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:46, output treesize:89 [2018-04-09 22:51:42,276 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 70 treesize of output 66 [2018-04-09 22:51:42,278 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 62 treesize of output 53 [2018-04-09 22:51:42,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-04-09 22:51:42,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,327 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 58 treesize of output 52 [2018-04-09 22:51:42,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:42,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:51:42,394 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 48 treesize of output 44 [2018-04-09 22:51:42,396 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 40 treesize of output 33 [2018-04-09 22:51:42,396 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,412 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 33 treesize of output 22 [2018-04-09 22:51:42,413 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:42,428 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 36 treesize of output 22 [2018-04-09 22:51:42,428 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,439 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-04-09 22:51:42,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-09 22:51:42,443 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,449 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-09 22:51:42,449 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,454 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,459 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 43 treesize of output 41 [2018-04-09 22:51:42,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-04-09 22:51:42,462 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-09 22:51:42,480 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,497 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 33 treesize of output 17 [2018-04-09 22:51:42,497 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,506 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,532 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 47 treesize of output 39 [2018-04-09 22:51:42,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-09 22:51:42,534 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,540 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-04-09 22:51:42,565 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-09 22:51:42,566 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,570 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-09 22:51:42,591 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:118, output treesize:67 [2018-04-09 22:51:42,719 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-09 22:51:42,719 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:42,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-09 22:51:42,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-09 22:51:42,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:42,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-04-09 22:51:42,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:42,837 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-04-09 22:51:42,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:42,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-09 22:51:42,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:99 [2018-04-09 22:51:43,089 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 33 treesize of output 35 [2018-04-09 22:51:43,091 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-04-09 22:51:43,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,103 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 30 treesize of output 28 [2018-04-09 22:51:43,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,114 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 23 treesize of output 21 [2018-04-09 22:51:43,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:43,128 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 1 case distinctions, treesize of input 33 treesize of output 33 [2018-04-09 22:51:43,130 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 28 treesize of output 24 [2018-04-09 22:51:43,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,141 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 16 treesize of output 14 [2018-04-09 22:51:43,142 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,151 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-09 22:51:43,152 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,158 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:43,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 9 [2018-04-09 22:51:43,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 22:51:43,203 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,204 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-04-09 22:51:43,205 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 5 treesize of output 3 [2018-04-09 22:51:43,206 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,206 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:43,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:43,238 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:199, output treesize:7 [2018-04-09 22:51:43,270 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-09 22:51:43,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:51:43,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2018-04-09 22:51:43,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 22:51:43,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 22:51:43,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-04-09 22:51:43,291 INFO L87 Difference]: Start difference. First operand 316 states and 340 transitions. Second operand 24 states. [2018-04-09 22:51:45,598 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 83 DAG size of output 67 [2018-04-09 22:51:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:51:45,995 INFO L93 Difference]: Finished difference Result 418 states and 445 transitions. [2018-04-09 22:51:45,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-09 22:51:45,996 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-04-09 22:51:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:51:45,997 INFO L225 Difference]: With dead ends: 418 [2018-04-09 22:51:45,997 INFO L226 Difference]: Without dead ends: 415 [2018-04-09 22:51:45,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=644, Invalid=2662, Unknown=0, NotChecked=0, Total=3306 [2018-04-09 22:51:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-04-09 22:51:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 321. [2018-04-09 22:51:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-09 22:51:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 345 transitions. [2018-04-09 22:51:46,011 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 345 transitions. Word has length 72 [2018-04-09 22:51:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:51:46,012 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 345 transitions. [2018-04-09 22:51:46,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 22:51:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 345 transitions. [2018-04-09 22:51:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-09 22:51:46,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:51:46,013 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-09 22:51:46,013 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, 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, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:51:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash 944121636, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:51:46,023 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:51:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:51:46,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:51:46,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:46,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:46,085 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-09 22:51:46,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 22:51:46,102 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-09 22:51:46,104 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-09 22:51:46,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,112 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-09 22:51:46,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-09 22:51:46,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:46,149 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 30 treesize of output 34 [2018-04-09 22:51:46,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:46,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,165 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-09 22:51:46,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-09 22:51:46,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-09 22:51:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-04-09 22:51:46,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:46,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:51:46,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-09 22:51:46,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:46,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,283 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 49 [2018-04-09 22:51:46,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 22:51:46,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,308 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 2 xjuncts. [2018-04-09 22:51:46,308 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:68, output treesize:92 [2018-04-09 22:51:46,393 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 69 treesize of output 56 [2018-04-09 22:51:46,394 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 33 treesize of output 27 [2018-04-09 22:51:46,395 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-09 22:51:46,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-09 22:51:46,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,406 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-09 22:51:46,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 22:51:46,415 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-09 22:51:46,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:51:46,421 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-09 22:51:46,421 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2018-04-09 22:51:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:51:46,463 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:51:50,915 WARN L148 SmtUtils]: Spent 4028ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-09 22:51:59,021 WARN L148 SmtUtils]: Spent 5982ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-09 22:51:59,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 114 [2018-04-09 22:51:59,163 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 77 treesize of output 82 [2018-04-09 22:51:59,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:59,299 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-09 22:51:59,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 101 [2018-04-09 22:51:59,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:51:59,585 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 92 [2018-04-09 22:51:59,586 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:59,719 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 107 [2018-04-09 22:51:59,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-09 22:51:59,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:51:59,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 106 [2018-04-09 22:52:00,938 WARN L151 SmtUtils]: Spent 1028ms on a formula simplification. DAG size of input: 460 DAG size of output 433 [2018-04-09 22:52:00,942 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:00,958 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 100 [2018-04-09 22:52:00,963 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:01,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 78 [2018-04-09 22:52:01,574 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-09 22:52:02,160 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:02,179 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 83 [2018-04-09 22:52:02,183 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:02,933 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:02,961 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 87 [2018-04-09 22:52:02,966 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-09 22:52:03,998 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:04,013 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-09 22:52:04,018 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:05,062 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 76 [2018-04-09 22:52:05,066 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:06,314 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-09 22:52:06,318 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:07,591 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:07,608 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 64 [2018-04-09 22:52:07,611 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-04-09 22:52:09,004 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 57 [2018-04-09 22:52:09,007 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-04-09 22:52:09,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:09,547 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 57 [2018-04-09 22:52:09,549 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-04-09 22:52:09,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2018-04-09 22:52:09,762 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:09,905 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 67 [2018-04-09 22:52:09,907 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:10,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-04-09 22:52:10,070 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2018-04-09 22:52:10,252 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:10,423 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 60 [2018-04-09 22:52:10,424 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:10,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 79 [2018-04-09 22:52:10,618 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:11,478 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 73 [2018-04-09 22:52:11,483 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:13,393 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 84 [2018-04-09 22:52:13,395 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:13,701 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 16 treesize of output 50 [2018-04-09 22:52:13,703 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2018-04-09 22:52:14,687 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 73 treesize of output 69 [2018-04-09 22:52:14,687 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:14,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 36 dim-1 vars, End of recursive call: 8 dim-0 vars, and 13 xjuncts. [2018-04-09 22:52:14,992 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 64 treesize of output 62 [2018-04-09 22:52:14,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2018-04-09 22:52:14,995 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:15,010 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 55 treesize of output 50 [2018-04-09 22:52:15,011 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:15,033 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 63 [2018-04-09 22:52:15,034 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:15,051 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:52:15,196 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 3 case distinctions, treesize of input 74 treesize of output 86 [2018-04-09 22:52:15,366 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 144 DAG size of output 139 [2018-04-09 22:52:15,383 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-09 22:52:15,386 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:15,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-04-09 22:52:15,513 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:15,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 64 [2018-04-09 22:52:15,621 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:15,759 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-09 22:52:15,763 INFO L267 ElimStorePlain]: Start of recursive call 37: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:15,957 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 78 [2018-04-09 22:52:15,961 INFO L267 ElimStorePlain]: Start of recursive call 38: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:16,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 72 [2018-04-09 22:52:16,193 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:16,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:16,462 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 81 [2018-04-09 22:52:16,466 INFO L267 ElimStorePlain]: Start of recursive call 40: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:16,816 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 68 [2018-04-09 22:52:16,818 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:16,824 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 57 treesize of output 53 [2018-04-09 22:52:16,824 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:17,070 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 54 treesize of output 52 [2018-04-09 22:52:17,071 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:17,072 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 56 treesize of output 52 [2018-04-09 22:52:17,072 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:17,277 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 65 [2018-04-09 22:52:17,278 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:17,496 INFO L267 ElimStorePlain]: Start of recursive call 33: 10 dim-1 vars, End of recursive call: 16 dim-0 vars, and 19 xjuncts. [2018-04-09 22:52:17,681 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 89 [2018-04-09 22:52:17,687 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 92 treesize of output 88 [2018-04-09 22:52:17,687 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:17,776 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 58 [2018-04-09 22:52:17,778 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 3 xjuncts. [2018-04-09 22:52:17,882 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 85 treesize of output 83 [2018-04-09 22:52:17,882 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:17,914 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2018-04-09 22:52:17,915 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:17,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 78 [2018-04-09 22:52:17,957 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:17,997 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 61 [2018-04-09 22:52:17,997 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,003 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 57 [2018-04-09 22:52:18,004 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,032 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 46 [2018-04-09 22:52:18,033 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 3 xjuncts. [2018-04-09 22:52:18,065 INFO L267 ElimStorePlain]: Start of recursive call 46: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:52:18,081 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 3 case distinctions, treesize of input 59 treesize of output 99 [2018-04-09 22:52:18,084 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 77 treesize of output 73 [2018-04-09 22:52:18,085 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,154 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 67 [2018-04-09 22:52:18,155 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,220 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 62 [2018-04-09 22:52:18,221 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:18,275 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 84 treesize of output 78 [2018-04-09 22:52:18,276 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,327 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 78 treesize of output 74 [2018-04-09 22:52:18,327 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:18,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-04-09 22:52:18,385 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:18,442 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-04-09 22:52:18,442 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:18,513 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 50 treesize of output 45 [2018-04-09 22:52:18,514 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-04-09 22:52:18,567 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,612 INFO L267 ElimStorePlain]: Start of recursive call 55: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:52:18,708 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 3 case distinctions, treesize of input 64 treesize of output 78 [2018-04-09 22:52:18,719 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 69 [2018-04-09 22:52:18,720 INFO L267 ElimStorePlain]: Start of recursive call 66: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:18,813 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 52 treesize of output 48 [2018-04-09 22:52:18,813 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,814 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 49 treesize of output 45 [2018-04-09 22:52:18,815 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:18,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:18,896 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 81 [2018-04-09 22:52:18,899 INFO L267 ElimStorePlain]: Start of recursive call 69: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:19,009 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:19,030 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 78 [2018-04-09 22:52:19,034 INFO L267 ElimStorePlain]: Start of recursive call 70: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:19,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-04-09 22:52:19,249 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:19,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:19,454 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-09 22:52:19,460 INFO L267 ElimStorePlain]: Start of recursive call 72: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:19,784 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 58 [2018-04-09 22:52:19,785 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:20,120 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 53 treesize of output 48 [2018-04-09 22:52:20,120 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:20,424 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:20,440 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-09 22:52:20,443 INFO L267 ElimStorePlain]: Start of recursive call 75: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:21,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-04-09 22:52:21,024 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:21,892 INFO L267 ElimStorePlain]: Start of recursive call 65: 13 dim-1 vars, End of recursive call: 15 dim-0 vars, and 17 xjuncts. [2018-04-09 22:52:22,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 126 [2018-04-09 22:52:22,035 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 94 treesize of output 86 [2018-04-09 22:52:22,036 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:22,695 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 86 treesize of output 82 [2018-04-09 22:52:22,696 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:23,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 100 [2018-04-09 22:52:23,341 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:24,013 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 77 treesize of output 71 [2018-04-09 22:52:24,014 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:24,015 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 74 treesize of output 68 [2018-04-09 22:52:24,015 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:24,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 100 [2018-04-09 22:52:24,626 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:25,247 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 77 treesize of output 71 [2018-04-09 22:52:25,247 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:25,249 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 74 treesize of output 68 [2018-04-09 22:52:25,249 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:25,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2018-04-09 22:52:25,810 INFO L267 ElimStorePlain]: Start of recursive call 86: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:26,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2018-04-09 22:52:26,405 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:26,411 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 74 treesize of output 72 [2018-04-09 22:52:26,411 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 2 xjuncts. [2018-04-09 22:52:27,052 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 102 treesize of output 98 [2018-04-09 22:52:27,053 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:27,680 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 100 [2018-04-09 22:52:27,681 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:28,470 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:28,486 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 103 [2018-04-09 22:52:28,490 INFO L267 ElimStorePlain]: Start of recursive call 91: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:29,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 79 [2018-04-09 22:52:29,501 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:52:30,513 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-09 22:52:30,516 INFO L267 ElimStorePlain]: Start of recursive call 93: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:31,885 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:31,901 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-09 22:52:31,905 INFO L267 ElimStorePlain]: Start of recursive call 94: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:33,270 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 89 [2018-04-09 22:52:33,272 INFO L267 ElimStorePlain]: Start of recursive call 95: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:34,702 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 100 [2018-04-09 22:52:34,708 INFO L267 ElimStorePlain]: Start of recursive call 96: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:36,370 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 89 [2018-04-09 22:52:36,372 INFO L267 ElimStorePlain]: Start of recursive call 97: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:38,133 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 72 treesize of output 70 [2018-04-09 22:52:38,133 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:38,134 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 75 treesize of output 73 [2018-04-09 22:52:38,135 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:39,714 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 66 treesize of output 58 [2018-04-09 22:52:39,714 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:41,428 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 72 treesize of output 70 [2018-04-09 22:52:41,429 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:41,430 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 75 treesize of output 73 [2018-04-09 22:52:41,430 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:43,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-09 22:52:43,156 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:44,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 71 [2018-04-09 22:52:44,837 INFO L267 ElimStorePlain]: Start of recursive call 104: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:46,366 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 83 treesize of output 77 [2018-04-09 22:52:46,366 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:47,879 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 116 treesize of output 112 [2018-04-09 22:52:47,880 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:52:49,574 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 88 [2018-04-09 22:52:49,576 INFO L267 ElimStorePlain]: Start of recursive call 107: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:52:51,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-04-09 22:52:51,191 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:51,192 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 68 treesize of output 64 [2018-04-09 22:52:51,193 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:52,464 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 60 [2018-04-09 22:52:52,464 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:53,407 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:53,423 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-09 22:52:53,427 INFO L267 ElimStorePlain]: Start of recursive call 111: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-09 22:52:54,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:52:54,753 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-09 22:52:54,757 INFO L267 ElimStorePlain]: Start of recursive call 112: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:52:56,156 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 105 treesize of output 101 [2018-04-09 22:52:56,157 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-04-09 22:52:57,542 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 103 [2018-04-09 22:52:57,543 INFO L267 ElimStorePlain]: Start of recursive call 114: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:53:00,462 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:53:00,479 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-09 22:53:00,482 INFO L267 ElimStorePlain]: Start of recursive call 115: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:53:05,629 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 65 [2018-04-09 22:53:05,630 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-04-09 22:53:07,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2018-04-09 22:53:07,342 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 22:53:10,173 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 92 [2018-04-09 22:53:10,174 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 2 xjuncts. [2018-04-09 22:53:11,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-04-09 22:53:11,689 INFO L267 ElimStorePlain]: Start of recursive call 119: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:53:13,148 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 67 treesize of output 61 [2018-04-09 22:53:13,148 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:53:13,150 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 67 treesize of output 61 [2018-04-09 22:53:13,150 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:53:14,789 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 76 treesize of output 74 [2018-04-09 22:53:14,790 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 22:53:19,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:53:19,848 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-09 22:53:19,851 INFO L267 ElimStorePlain]: Start of recursive call 123: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:53:24,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2018-04-09 22:53:24,354 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-04-09 22:53:24,355 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 69 treesize of output 67 [2018-04-09 22:53:24,355 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-04-09 22:53:28,834 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:53:28,852 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 77 [2018-04-09 22:53:28,855 INFO L267 ElimStorePlain]: Start of recursive call 126: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:53:31,878 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 77 [2018-04-09 22:53:31,881 INFO L267 ElimStorePlain]: Start of recursive call 127: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:53:49,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:53:49,863 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-09 22:53:49,866 INFO L267 ElimStorePlain]: Start of recursive call 128: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-09 22:53:54,142 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:53:54,159 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-09 22:53:54,162 INFO L267 ElimStorePlain]: Start of recursive call 129: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:53:59,617 INFO L267 ElimStorePlain]: Start of recursive call 77: 57 dim-1 vars, End of recursive call: 55 dim-0 vars, and 57 xjuncts. [2018-04-09 22:53:59,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 110 [2018-04-09 22:53:59,991 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 22:54:04,667 WARN L151 SmtUtils]: Spent 4656ms on a formula simplification. DAG size of input: 1026 DAG size of output 951 [2018-04-09 22:54:04,670 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 109 treesize of output 99 [2018-04-09 22:54:04,702 INFO L267 ElimStorePlain]: Start of recursive call 131: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:54:04,704 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 106 treesize of output 92 [2018-04-09 22:54:04,704 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-04-09 22:54:04,705 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 114 treesize of output 104 [2018-04-09 22:54:04,706 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:54:07,159 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 92 treesize of output 90 [2018-04-09 22:54:07,160 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-04-09 22:54:07,175 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 124 [2018-04-09 22:54:07,176 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 2 xjuncts. [2018-04-09 22:54:07,182 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 105 [2018-04-09 22:54:07,183 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-04-09 22:54:09,717 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:54:09,732 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 87 [2018-04-09 22:54:09,755 INFO L267 ElimStorePlain]: Start of recursive call 137: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:54:12,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 99 [2018-04-09 22:54:12,291 INFO L267 ElimStorePlain]: Start of recursive call 138: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:54:14,841 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 99 treesize of output 97 [2018-04-09 22:54:14,841 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-04-09 22:54:17,554 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 103 [2018-04-09 22:54:17,557 INFO L267 ElimStorePlain]: Start of recursive call 140: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:54:20,274 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 87 [2018-04-09 22:54:20,275 INFO L267 ElimStorePlain]: Start of recursive call 141: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 22:54:23,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-04-09 22:54:23,168 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:54:26,160 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-09 22:54:26,164 INFO L267 ElimStorePlain]: Start of recursive call 143: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:54:29,257 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 67 [2018-04-09 22:54:29,258 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 2 xjuncts. [2018-04-09 22:54:32,483 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 92 [2018-04-09 22:54:32,484 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-04-09 22:54:35,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:54:35,928 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 64 [2018-04-09 22:54:35,930 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 3 xjuncts. [2018-04-09 22:54:40,585 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 91 [2018-04-09 22:54:40,586 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 2 xjuncts. [2018-04-09 22:54:46,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:54:46,840 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 100 [2018-04-09 22:54:46,844 INFO L267 ElimStorePlain]: Start of recursive call 148: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:54:50,117 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:54:50,134 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-09 22:54:50,137 INFO L267 ElimStorePlain]: Start of recursive call 149: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:54:54,003 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 92 [2018-04-09 22:54:54,004 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 2 xjuncts. [2018-04-09 22:55:00,810 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 86 [2018-04-09 22:55:00,811 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-04-09 22:55:05,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:55:05,854 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 103 [2018-04-09 22:55:05,879 INFO L267 ElimStorePlain]: Start of recursive call 152: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:55:10,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-09 22:55:10,650 INFO L267 ElimStorePlain]: Start of recursive call 153: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:55:15,873 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 66 treesize of output 60 [2018-04-09 22:55:15,874 INFO L267 ElimStorePlain]: Start of recursive call 154: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:55:20,591 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:55:20,608 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 77 [2018-04-09 22:55:20,611 INFO L267 ElimStorePlain]: Start of recursive call 155: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-09 22:55:26,314 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 67 treesize of output 61 [2018-04-09 22:55:26,315 INFO L267 ElimStorePlain]: Start of recursive call 156: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:55:31,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:55:31,678 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 103 [2018-04-09 22:55:31,682 INFO L267 ElimStorePlain]: Start of recursive call 157: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. Received shutdown request... [2018-04-09 22:55:37,634 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 22:55:37,635 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 22:55:37,640 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 22:55:37,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 10:55:37 BoogieIcfgContainer [2018-04-09 22:55:37,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 22:55:37,641 INFO L168 Benchmark]: Toolchain (without parser) took 263456.20 ms. Allocated memory was 303.0 MB in the beginning and 439.9 MB in the end (delta: 136.8 MB). Free memory was 240.2 MB in the beginning and 305.4 MB in the end (delta: -65.2 MB). Peak memory consumption was 377.2 MB. Max. memory is 5.3 GB. [2018-04-09 22:55:37,643 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.0 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 22:55:37,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.26 ms. Allocated memory is still 303.0 MB. Free memory was 240.2 MB in the beginning and 212.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-04-09 22:55:37,643 INFO L168 Benchmark]: Boogie Preprocessor took 68.48 ms. Allocated memory is still 303.0 MB. Free memory was 212.2 MB in the beginning and 209.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:55:37,643 INFO L168 Benchmark]: RCFGBuilder took 785.40 ms. Allocated memory was 303.0 MB in the beginning and 464.0 MB in the end (delta: 161.0 MB). Free memory was 208.2 MB in the beginning and 376.0 MB in the end (delta: -167.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. [2018-04-09 22:55:37,644 INFO L168 Benchmark]: TraceAbstraction took 262251.79 ms. Allocated memory was 464.0 MB in the beginning and 439.9 MB in the end (delta: -24.1 MB). Free memory was 374.6 MB in the beginning and 305.4 MB in the end (delta: 69.2 MB). Peak memory consumption was 350.6 MB. Max. memory is 5.3 GB. [2018-04-09 22:55:37,646 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.22 ms. Allocated memory is still 303.0 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 345.26 ms. Allocated memory is still 303.0 MB. Free memory was 240.2 MB in the beginning and 212.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 68.48 ms. Allocated memory is still 303.0 MB. Free memory was 212.2 MB in the beginning and 209.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 785.40 ms. Allocated memory was 303.0 MB in the beginning and 464.0 MB in the end (delta: 161.0 MB). Free memory was 208.2 MB in the beginning and 376.0 MB in the end (delta: -167.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 262251.79 ms. Allocated memory was 464.0 MB in the beginning and 439.9 MB in the end (delta: -24.1 MB). Free memory was 374.6 MB in the beginning and 305.4 MB in the end (delta: 69.2 MB). Peak memory consumption was 350.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1070]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1070]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 889. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 203 locations, 69 error locations. TIMEOUT Result, 262.2s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3485 SDtfs, 9455 SDslu, 11632 SDs, 0 SdLazy, 9744 SolverSat, 754 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1717 SyntacticMatches, 12 SemanticMatches, 397 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=26, 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.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 1419 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1906 ConstructedInterpolants, 124 QuantifiedInterpolants, 1157255 SizeOfPredicates, 239 NumberOfNonLiveVariables, 3742 ConjunctsInSsa, 359 ConjunctsInUnsatCore, 52 InterpolantComputations, 38 PerfectInterpolantSequences, 16/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_22-55-37-655.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_22-55-37-655.csv Completed graceful shutdown