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-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 21:45:52,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 21:45:52,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 21:45:52,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 21:45:52,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 21:45:52,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 21:45:52,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 21:45:52,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 21:45:52,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 21:45:52,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 21:45:52,492 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 21:45:52,492 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 21:45:52,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 21:45:52,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 21:45:52,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 21:45:52,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 21:45:52,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 21:45:52,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 21:45:52,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 21:45:52,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 21:45:52,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 21:45:52,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 21:45:52,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 21:45:52,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 21:45:52,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 21:45:52,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 21:45:52,511 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 21:45:52,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 21:45:52,512 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 21:45:52,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 21:45:52,513 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 21:45:52,513 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-06 21:45:52,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 21:45:52,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 21:45:52,539 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 21:45:52,539 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 21:45:52,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 21:45:52,540 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 21:45:52,540 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 21:45:52,540 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 21:45:52,541 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 21:45:52,541 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 21:45:52,541 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 21:45:52,541 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 21:45:52,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 21:45:52,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 21:45:52,542 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 21:45:52,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 21:45:52,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 21:45:52,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 21:45:52,543 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 21:45:52,543 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 21:45:52,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 21:45:52,543 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 21:45:52,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 21:45:52,544 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 21:45:52,544 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 21:45:52,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 21:45:52,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:45:52,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 21:45:52,545 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 21:45:52,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 21:45:52,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 21:45:52,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 21:45:52,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:45:52,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 21:45:52,546 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 21:45:52,547 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 21:45:52,547 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 21:45:52,547 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 21:45:52,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 21:45:52,596 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 21:45:52,600 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 21:45:52,602 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 21:45:52,602 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 21:45:52,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:52,983 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7e637bc24 [2018-04-06 21:45:53,151 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 21:45:53,152 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 21:45:53,152 INFO L168 CDTParser]: Scanning dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,164 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 21:45:53,164 INFO L215 ultiparseSymbolTable]: [2018-04-06 21:45:53,165 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 21:45:53,165 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,165 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 21:45:53,165 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__register_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,165 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsword_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,165 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,165 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_once_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_attr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sig_atomic_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__wchar_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____socklen_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,166 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____useconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_condattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutexattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,167 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_cond_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,168 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_spinlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__div_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__size_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_set in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____intptr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__SLL in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrierattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ulong in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__lldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____qaddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_ulong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrier_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ushort in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutex_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_slong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pthread_slist_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__idtype_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uint in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlockattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:53,195 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7e637bc24 [2018-04-06 21:45:53,200 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 21:45:53,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 21:45:53,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 21:45:53,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 21:45:53,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 21:45:53,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e85df86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53, skipping insertion in model container [2018-04-06 21:45:53,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,227 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:45:53,260 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:45:53,430 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:45:53,483 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:45:53,491 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-06 21:45:53,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53 WrapperNode [2018-04-06 21:45:53,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 21:45:53,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 21:45:53,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 21:45:53,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 21:45:53,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (1/1) ... [2018-04-06 21:45:53,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 21:45:53,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 21:45:53,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 21:45:53,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 21:45:53,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (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-06 21:45:53,739 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 21:45:53,739 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 21:45:53,739 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 21:45:53,739 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 21:45:53,739 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 21:45:53,739 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 21:45:53,740 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 21:45:53,740 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 21:45:53,740 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 21:45:53,740 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 21:45:53,740 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 21:45:53,740 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 21:45:53,740 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 21:45:53,741 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 21:45:53,741 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 21:45:53,741 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 21:45:53,741 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 21:45:53,741 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 21:45:53,741 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 21:45:53,742 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 21:45:53,742 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 21:45:53,742 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 21:45:53,742 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 21:45:53,742 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 21:45:53,742 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 21:45:53,742 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 21:45:53,743 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 21:45:53,743 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 21:45:53,743 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 21:45:53,743 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 21:45:53,743 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 21:45:53,743 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 21:45:53,743 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 21:45:53,744 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 21:45:53,745 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 21:45:53,745 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 21:45:53,745 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 21:45:53,745 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 21:45:53,745 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 21:45:53,745 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 21:45:53,745 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 21:45:53,746 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 21:45:53,747 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 21:45:53,748 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 21:45:53,749 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 21:45:53,750 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 21:45:53,751 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 21:45:53,752 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 21:45:54,318 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 21:45:54,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:45:54 BoogieIcfgContainer [2018-04-06 21:45:54,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 21:45:54,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 21:45:54,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 21:45:54,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 21:45:54,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:45:53" (1/3) ... [2018-04-06 21:45:54,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d3c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:45:54, skipping insertion in model container [2018-04-06 21:45:54,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:45:53" (2/3) ... [2018-04-06 21:45:54,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d3c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:45:54, skipping insertion in model container [2018-04-06 21:45:54,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:45:54" (3/3) ... [2018-04-06 21:45:54,326 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-06 21:45:54,335 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 21:45:54,343 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-04-06 21:45:54,384 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 21:45:54,384 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 21:45:54,385 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 21:45:54,385 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 21:45:54,385 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 21:45:54,385 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 21:45:54,385 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 21:45:54,385 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 21:45:54,385 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 21:45:54,386 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 21:45:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-04-06 21:45:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-06 21:45:54,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:54,409 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:54,409 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1950382058, 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-06 21:45:54,427 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:54,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:54,497 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-06 21:45:54,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:54,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:54,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:45:54,517 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-06 21:45:54,517 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:54,523 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-06 21:45:54,547 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:54,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 21:45:54,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 21:45:54,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 21:45:54,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:45:54,563 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 4 states. [2018-04-06 21:45:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:54,908 INFO L93 Difference]: Finished difference Result 331 states and 371 transitions. [2018-04-06 21:45:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 21:45:54,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-06 21:45:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:54,923 INFO L225 Difference]: With dead ends: 331 [2018-04-06 21:45:54,923 INFO L226 Difference]: Without dead ends: 201 [2018-04-06 21:45:54,928 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-06 21:45:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-06 21:45:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2018-04-06 21:45:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-06 21:45:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2018-04-06 21:45:54,974 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 9 [2018-04-06 21:45:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:54,974 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2018-04-06 21:45:54,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 21:45:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2018-04-06 21:45:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-06 21:45:54,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:54,975 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:54,975 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1950382057, 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-06 21:45:54,985 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:54,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:55,018 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-06 21:45:55,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:55,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:55,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:45:55,044 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-06 21:45:55,044 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:55,067 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-06 21:45:55,087 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:55,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 21:45:55,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 21:45:55,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 21:45:55,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:45:55,090 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 6 states. [2018-04-06 21:45:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:55,315 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-04-06 21:45:55,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 21:45:55,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-06 21:45:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:55,318 INFO L225 Difference]: With dead ends: 185 [2018-04-06 21:45:55,318 INFO L226 Difference]: Without dead ends: 182 [2018-04-06 21:45:55,320 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-06 21:45:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-06 21:45:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2018-04-06 21:45:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-06 21:45:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-04-06 21:45:55,334 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 9 [2018-04-06 21:45:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:55,334 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-04-06 21:45:55,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 21:45:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-04-06 21:45:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-06 21:45:55,335 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:55,335 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:55,336 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1719971451, 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-06 21:45:55,344 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:55,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:55,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:55,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:55,420 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-06 21:45:55,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:55,434 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-06 21:45:55,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-06 21:45:55,455 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-06 21:45:55,455 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:55,500 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-06 21:45:55,536 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:55,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 21:45:55,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 21:45:55,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 21:45:55,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:45:55,538 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 7 states. [2018-04-06 21:45:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:55,862 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-04-06 21:45:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 21:45:55,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-04-06 21:45:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:55,863 INFO L225 Difference]: With dead ends: 182 [2018-04-06 21:45:55,863 INFO L226 Difference]: Without dead ends: 163 [2018-04-06 21:45:55,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-04-06 21:45:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-06 21:45:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2018-04-06 21:45:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-06 21:45:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2018-04-06 21:45:55,875 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 18 [2018-04-06 21:45:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:55,875 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2018-04-06 21:45:55,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 21:45:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2018-04-06 21:45:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-06 21:45:55,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:55,876 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:55,876 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1719971452, 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-06 21:45:55,883 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:55,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:55,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:55,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:55,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 21:45:55,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:55,936 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-06 21:45:55,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:55,944 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-06 21:45:55,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-06 21:45:55,956 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-06 21:45:55,957 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:56,052 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-06 21:45:56,075 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:56,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-06 21:45:56,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 21:45:56,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 21:45:56,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-06 21:45:56,076 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 8 states. [2018-04-06 21:45:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:56,303 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-04-06 21:45:56,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 21:45:56,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-06 21:45:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:56,304 INFO L225 Difference]: With dead ends: 158 [2018-04-06 21:45:56,304 INFO L226 Difference]: Without dead ends: 147 [2018-04-06 21:45:56,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-06 21:45:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-06 21:45:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2018-04-06 21:45:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-06 21:45:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-04-06 21:45:56,314 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 18 [2018-04-06 21:45:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:56,315 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-04-06 21:45:56,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 21:45:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-04-06 21:45:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-06 21:45:56,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:56,316 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:56,316 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:56,316 INFO L82 PathProgramCache]: Analyzing trace with hash -669844482, 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-06 21:45:56,325 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:56,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:56,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:45:56,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:45:56,359 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-06 21:45:56,361 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-06 21:45:56,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,372 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-06 21:45:56,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-06 21:45:56,378 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-06 21:45:56,384 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-06 21:45:56,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,386 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-06 21:45:56,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-06 21:45:56,390 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-06 21:45:56,390 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:56,395 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-06 21:45:56,416 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:56,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 21:45:56,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 21:45:56,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 21:45:56,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:45:56,417 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 5 states. [2018-04-06 21:45:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:56,621 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2018-04-06 21:45:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:45:56,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-06 21:45:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:56,623 INFO L225 Difference]: With dead ends: 243 [2018-04-06 21:45:56,623 INFO L226 Difference]: Without dead ends: 242 [2018-04-06 21:45:56,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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-06 21:45:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-06 21:45:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 139. [2018-04-06 21:45:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-06 21:45:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2018-04-06 21:45:56,634 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 20 [2018-04-06 21:45:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:56,634 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2018-04-06 21:45:56,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 21:45:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2018-04-06 21:45:56,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-06 21:45:56,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:56,635 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:56,635 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:56,636 INFO L82 PathProgramCache]: Analyzing trace with hash -669844481, 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-06 21:45:56,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:56,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:56,672 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-06 21:45:56,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:45:56,695 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-06 21:45:56,697 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-06 21:45:56,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,705 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-06 21:45:56,707 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-06 21:45:56,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,713 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-06 21:45:56,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-06 21:45:56,721 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-06 21:45:56,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 13 treesize of output 5 [2018-04-06 21:45:56,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,730 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-06 21:45:56,732 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-06 21:45:56,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:56,737 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-06 21:45:56,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-06 21:45:56,749 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-06 21:45:56,750 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:56,779 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-06 21:45:56,801 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:56,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-06 21:45:56,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 21:45:56,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 21:45:56,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-06 21:45:56,802 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 8 states. [2018-04-06 21:45:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:57,115 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2018-04-06 21:45:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 21:45:57,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-06 21:45:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:57,117 INFO L225 Difference]: With dead ends: 253 [2018-04-06 21:45:57,118 INFO L226 Difference]: Without dead ends: 252 [2018-04-06 21:45:57,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 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-06 21:45:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-06 21:45:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 138. [2018-04-06 21:45:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-06 21:45:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-06 21:45:57,127 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 20 [2018-04-06 21:45:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:57,127 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-06 21:45:57,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 21:45:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-06 21:45:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-06 21:45:57,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:57,129 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:57,129 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1964971391, 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-06 21:45:57,137 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:57,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:57,159 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-06 21:45:57,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:45:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:45:57,168 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:57,172 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-06 21:45:57,194 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:57,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 21:45:57,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 21:45:57,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 21:45:57,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:45:57,195 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 4 states. [2018-04-06 21:45:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:57,326 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2018-04-06 21:45:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:45:57,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-06 21:45:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:57,327 INFO L225 Difference]: With dead ends: 200 [2018-04-06 21:45:57,327 INFO L226 Difference]: Without dead ends: 199 [2018-04-06 21:45:57,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-06 21:45:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-06 21:45:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 137. [2018-04-06 21:45:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-06 21:45:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-04-06 21:45:57,335 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 22 [2018-04-06 21:45:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:57,335 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-04-06 21:45:57,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 21:45:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-04-06 21:45:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-06 21:45:57,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:57,336 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:45:57,336 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1964971392, 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-06 21:45:57,354 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:57,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:57,373 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-06 21:45:57,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:45:57,384 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-06 21:45:57,384 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:57,399 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-06 21:45:57,421 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:57,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 21:45:57,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 21:45:57,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 21:45:57,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:45:57,422 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 6 states. [2018-04-06 21:45:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:57,620 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2018-04-06 21:45:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 21:45:57,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-06 21:45:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:57,622 INFO L225 Difference]: With dead ends: 208 [2018-04-06 21:45:57,622 INFO L226 Difference]: Without dead ends: 205 [2018-04-06 21:45:57,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 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-06 21:45:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-06 21:45:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 134. [2018-04-06 21:45:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-06 21:45:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-04-06 21:45:57,636 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 22 [2018-04-06 21:45:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:57,636 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-04-06 21:45:57,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 21:45:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-04-06 21:45:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 21:45:57,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:57,637 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-06 21:45:57,637 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:57,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1702221006, 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-06 21:45:57,644 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:57,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:57,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:57,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:57,682 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-06 21:45:57,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-06 21:45:57,704 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-06 21:45:57,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 21:45:57,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,718 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-06 21:45:57,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-06 21:45:57,749 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-06 21:45:57,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-06 21:45:57,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,780 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-06 21:45:57,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-06 21:45:57,806 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-06 21:45:57,809 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-06 21:45:57,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-06 21:45:57,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:57,822 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-06 21:45:57,822 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-06 21:45:57,843 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-06 21:45:57,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:45:57,926 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:57,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2018-04-06 21:45:57,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-06 21:45:57,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-06 21:45:57,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-06 21:45:57,927 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 14 states. [2018-04-06 21:45:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:45:58,664 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2018-04-06 21:45:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-06 21:45:58,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-04-06 21:45:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:45:58,665 INFO L225 Difference]: With dead ends: 275 [2018-04-06 21:45:58,666 INFO L226 Difference]: Without dead ends: 274 [2018-04-06 21:45:58,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2018-04-06 21:45:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-06 21:45:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 133. [2018-04-06 21:45:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-06 21:45:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-04-06 21:45:58,675 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2018-04-06 21:45:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:45:58,676 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-04-06 21:45:58,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-06 21:45:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-04-06 21:45:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 21:45:58,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:45:58,677 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-06 21:45:58,677 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:45:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1702221007, 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-06 21:45:58,683 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:45:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:45:58,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:45:58,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:58,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:45:58,710 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-06 21:45:58,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,720 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-06 21:45:58,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 21:45:58,741 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-06 21:45:58,743 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-06 21:45:58,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,752 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-06 21:45:58,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, 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-06 21:45:58,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,759 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-06 21:45:58,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-06 21:45:58,787 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-06 21:45:58,790 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-06 21:45:58,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,807 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-06 21:45:58,809 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-06 21:45:58,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,823 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-06 21:45:58,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-06 21:45:58,850 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-06 21:45:58,853 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-06 21:45:58,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-06 21:45:58,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,877 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-06 21:45:58,884 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-06 21:45:58,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,889 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-06 21:45:58,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,893 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:58,898 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-06 21:45:58,898 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-06 21:45:58,920 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-06 21:45:58,920 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:45:59,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-06 21:45:59,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 9 treesize of output 8 [2018-04-06 21:45:59,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,115 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-06 21:45:59,118 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-06 21:45:59,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,123 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-06 21:45:59,132 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-06 21:45:59,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-06 21:45:59,149 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,165 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-06 21:45:59,167 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-06 21:45:59,167 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,179 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-06 21:45:59,182 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-06 21:45:59,182 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,183 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,195 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-06 21:45:59,219 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 35 treesize of output 29 [2018-04-06 21:45:59,234 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-06 21:45:59,235 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,247 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-06 21:45:59,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 14 treesize of output 5 [2018-04-06 21:45:59,250 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,251 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,253 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-06 21:45:59,256 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-06 21:45:59,256 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,259 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,270 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-06 21:45:59,299 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-06 21:45:59,300 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:103, output treesize:37 [2018-04-06 21:45:59,345 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:45:59,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:45:59,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:1 [2018-04-06 21:45:59,355 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-06 21:45:59,377 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:45:59,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-06 21:45:59,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-06 21:45:59,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-06 21:45:59,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-06 21:45:59,378 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 18 states. [2018-04-06 21:46:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:00,241 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-06 21:46:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-06 21:46:00,271 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-04-06 21:46:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:00,272 INFO L225 Difference]: With dead ends: 158 [2018-04-06 21:46:00,273 INFO L226 Difference]: Without dead ends: 156 [2018-04-06 21:46:00,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2018-04-06 21:46:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-06 21:46:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 131. [2018-04-06 21:46:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-06 21:46:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-04-06 21:46:00,280 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 25 [2018-04-06 21:46:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:00,281 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-04-06 21:46:00,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-06 21:46:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-04-06 21:46:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-06 21:46:00,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:00,282 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-06 21:46:00,282 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:00,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1028737800, 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-06 21:46:00,289 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:00,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:00,318 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-06 21:46:00,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:00,324 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-06 21:46:00,350 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:00,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 21:46:00,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 21:46:00,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 21:46:00,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:46:00,351 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 4 states. [2018-04-06 21:46:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:00,494 INFO L93 Difference]: Finished difference Result 231 states and 251 transitions. [2018-04-06 21:46:00,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:46:00,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-06 21:46:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:00,495 INFO L225 Difference]: With dead ends: 231 [2018-04-06 21:46:00,495 INFO L226 Difference]: Without dead ends: 230 [2018-04-06 21:46:00,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-06 21:46:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-06 21:46:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 134. [2018-04-06 21:46:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-06 21:46:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-04-06 21:46:00,503 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 28 [2018-04-06 21:46:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:00,503 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-04-06 21:46:00,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 21:46:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-04-06 21:46:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-06 21:46:00,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:00,505 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-06 21:46:00,505 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:00,505 INFO L82 PathProgramCache]: Analyzing trace with hash 826922200, 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-06 21:46:00,516 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:00,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:00,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:00,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 21:46:00,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:00,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:00,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:00,590 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-06 21:46:00,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:00,595 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-06 21:46:00,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-06 21:46:00,606 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-06 21:46:00,606 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:00,684 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-06 21:46:00,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:00,687 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-06 21:46:00,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-06 21:46:00,696 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:46:00,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:00,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:00,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:1 [2018-04-06 21:46:00,701 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-06 21:46:00,723 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:00,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-04-06 21:46:00,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 21:46:00,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 21:46:00,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-06 21:46:00,724 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 12 states. [2018-04-06 21:46:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:00,987 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-04-06 21:46:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 21:46:00,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-04-06 21:46:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:00,988 INFO L225 Difference]: With dead ends: 186 [2018-04-06 21:46:00,988 INFO L226 Difference]: Without dead ends: 184 [2018-04-06 21:46:00,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-04-06 21:46:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-06 21:46:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 145. [2018-04-06 21:46:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-06 21:46:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-04-06 21:46:01,001 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 30 [2018-04-06 21:46:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:01,001 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-04-06 21:46:01,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 21:46:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-04-06 21:46:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 21:46:01,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:01,003 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] [2018-04-06 21:46:01,003 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1528983194, 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-06 21:46:01,009 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:01,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:01,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:46:01,045 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-06 21:46:01,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,053 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-06 21:46:01,057 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-06 21:46:01,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-06 21:46:01,074 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-06 21:46:01,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:01,078 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-06 21:46:01,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,091 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-06 21:46:01,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:01,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:46:01,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-06 21:46:01,120 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-06 21:46:01,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:01,123 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-06 21:46:01,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,131 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-06 21:46:01,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:01,134 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-06 21:46:01,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,138 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-06 21:46:01,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-06 21:46:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:01,146 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:01,184 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:01,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2018-04-06 21:46:01,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 21:46:01,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 21:46:01,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:46:01,185 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 7 states. [2018-04-06 21:46:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:01,343 INFO L93 Difference]: Finished difference Result 270 states and 296 transitions. [2018-04-06 21:46:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 21:46:01,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-06 21:46:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:01,344 INFO L225 Difference]: With dead ends: 270 [2018-04-06 21:46:01,344 INFO L226 Difference]: Without dead ends: 170 [2018-04-06 21:46:01,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-06 21:46:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-06 21:46:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 156. [2018-04-06 21:46:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-06 21:46:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 171 transitions. [2018-04-06 21:46:01,354 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 171 transitions. Word has length 32 [2018-04-06 21:46:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:01,354 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 171 transitions. [2018-04-06 21:46:01,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 21:46:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2018-04-06 21:46:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-06 21:46:01,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:01,355 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:46:01,355 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1093092895, 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-06 21:46:01,362 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:01,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:01,420 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-06 21:46:01,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-06 21:46:01,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,433 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-06 21:46:01,435 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-06 21:46:01,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,441 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-06 21:46:01,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 21:46:01,460 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-06 21:46:01,460 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:01,501 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-06 21:46:01,523 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:01,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2018-04-06 21:46:01,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 21:46:01,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 21:46:01,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:46:01,524 INFO L87 Difference]: Start difference. First operand 156 states and 171 transitions. Second operand 7 states. [2018-04-06 21:46:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:01,792 INFO L93 Difference]: Finished difference Result 304 states and 332 transitions. [2018-04-06 21:46:01,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 21:46:01,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-04-06 21:46:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:01,794 INFO L225 Difference]: With dead ends: 304 [2018-04-06 21:46:01,794 INFO L226 Difference]: Without dead ends: 237 [2018-04-06 21:46:01,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-04-06 21:46:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-06 21:46:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 170. [2018-04-06 21:46:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-06 21:46:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-04-06 21:46:01,810 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 33 [2018-04-06 21:46:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:01,811 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-04-06 21:46:01,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 21:46:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-04-06 21:46:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-06 21:46:01,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:01,812 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] [2018-04-06 21:46:01,812 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1805088933, 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-06 21:46:01,819 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:01,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:01,884 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-06 21:46:01,884 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:01,906 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 16 treesize of output 20 [2018-04-06 21:46:01,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-06 21:46:01,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-04-06 21:46:01,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:01,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:46:01,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:14 [2018-04-06 21:46:01,949 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-06 21:46:01,971 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:01,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-06 21:46:01,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 21:46:01,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 21:46:01,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-06 21:46:01,972 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 12 states. [2018-04-06 21:46:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:02,702 INFO L93 Difference]: Finished difference Result 261 states and 279 transitions. [2018-04-06 21:46:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-06 21:46:02,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-04-06 21:46:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:02,704 INFO L225 Difference]: With dead ends: 261 [2018-04-06 21:46:02,704 INFO L226 Difference]: Without dead ends: 260 [2018-04-06 21:46:02,704 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2018-04-06 21:46:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-06 21:46:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 167. [2018-04-06 21:46:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-06 21:46:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2018-04-06 21:46:02,715 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 35 [2018-04-06 21:46:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:02,715 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2018-04-06 21:46:02,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 21:46:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2018-04-06 21:46:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-06 21:46:02,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:02,715 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:46:02,716 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash -969628330, 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-06 21:46:02,738 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:02,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:02,769 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-06 21:46:02,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:46:02,829 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 19 treesize of output 14 [2018-04-06 21:46:02,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-04-06 21:46:02,879 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-06 21:46:02,881 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-06 21:46:02,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 21:46:02,895 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-06 21:46:02,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,903 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-06 21:46:02,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-04-06 21:46:02,917 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 30 treesize of output 23 [2018-04-06 21:46:02,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:02,922 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 23 treesize of output 32 [2018-04-06 21:46:02,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,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 23 treesize of output 18 [2018-04-06 21:46:02,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:02,948 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 18 treesize of output 25 [2018-04-06 21:46:02,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:02,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-04-06 21:46:03,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-06 21:46:03,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:03,008 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 20 treesize of output 12 [2018-04-06 21:46:03,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:03,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:03,035 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 33 treesize of output 25 [2018-04-06 21:46:03,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:03,038 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 25 treesize of output 15 [2018-04-06 21:46:03,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:03,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:03,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:03,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:19 [2018-04-06 21:46:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:03,074 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:03,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:46:03,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-04-06 21:46:03,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-06 21:46:03,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-06 21:46:03,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-04-06 21:46:03,251 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand 20 states. [2018-04-06 21:46:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:04,378 INFO L93 Difference]: Finished difference Result 277 states and 295 transitions. [2018-04-06 21:46:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-06 21:46:04,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-04-06 21:46:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:04,379 INFO L225 Difference]: With dead ends: 277 [2018-04-06 21:46:04,380 INFO L226 Difference]: Without dead ends: 276 [2018-04-06 21:46:04,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=846, Unknown=0, NotChecked=0, Total=1190 [2018-04-06 21:46:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-06 21:46:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2018-04-06 21:46:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-06 21:46:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 194 transitions. [2018-04-06 21:46:04,390 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 194 transitions. Word has length 35 [2018-04-06 21:46:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:04,390 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 194 transitions. [2018-04-06 21:46:04,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-06 21:46:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 194 transitions. [2018-04-06 21:46:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-06 21:46:04,391 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:04,391 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:46:04,391 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash -969628331, 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-06 21:46:04,411 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:04,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:04,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:04,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:04,452 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-06 21:46:04,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-06 21:46:04,492 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-06 21:46:04,495 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-06 21:46:04,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,510 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-06 21:46:04,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-06 21:46:04,522 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 31 treesize of output 24 [2018-04-06 21:46:04,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:04,526 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 24 treesize of output 33 [2018-04-06 21:46:04,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-06 21:46:04,571 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 26 [2018-04-06 21:46:04,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:04,576 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 16 [2018-04-06 21:46:04,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:04,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:15 [2018-04-06 21:46:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:04,610 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:04,673 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:04,673 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2018-04-06 21:46:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:04,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:46:04,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-04-06 21:46:04,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-06 21:46:04,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-06 21:46:04,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-04-06 21:46:04,698 INFO L87 Difference]: Start difference. First operand 177 states and 194 transitions. Second operand 15 states. [2018-04-06 21:46:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:05,193 INFO L93 Difference]: Finished difference Result 234 states and 250 transitions. [2018-04-06 21:46:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-06 21:46:05,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-06 21:46:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:05,195 INFO L225 Difference]: With dead ends: 234 [2018-04-06 21:46:05,195 INFO L226 Difference]: Without dead ends: 233 [2018-04-06 21:46:05,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2018-04-06 21:46:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-06 21:46:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 177. [2018-04-06 21:46:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-06 21:46:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2018-04-06 21:46:05,206 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 35 [2018-04-06 21:46:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:05,206 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2018-04-06 21:46:05,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-06 21:46:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2018-04-06 21:46:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 21:46:05,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:05,207 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:46:05,207 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:05,207 INFO L82 PathProgramCache]: Analyzing trace with hash 941973104, 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-06 21:46:05,223 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:05,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:05,265 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-06 21:46:05,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 21:46:05,288 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-06 21:46:05,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:46:05,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,299 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-06 21:46:05,301 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-06 21:46:05,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,306 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-06 21:46:05,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-06 21:46:05,317 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-06 21:46:05,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:05,320 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-06 21:46:05,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-06 21:46:05,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:05,337 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 18 treesize of output 25 [2018-04-06 21:46:05,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-06 21:46:05,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-06 21:46:05,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:05,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-06 21:46:05,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,390 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-06 21:46:05,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:05,393 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-06 21:46:05,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:05,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:05,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2018-04-06 21:46:05,437 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-06 21:46:05,437 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:05,685 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-06 21:46:05,710 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:05,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 9] imperfect sequences [] total 20 [2018-04-06 21:46:05,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 21:46:05,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 21:46:05,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-04-06 21:46:05,712 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 21 states. [2018-04-06 21:46:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:06,755 INFO L93 Difference]: Finished difference Result 282 states and 300 transitions. [2018-04-06 21:46:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-06 21:46:06,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-04-06 21:46:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:06,757 INFO L225 Difference]: With dead ends: 282 [2018-04-06 21:46:06,757 INFO L226 Difference]: Without dead ends: 279 [2018-04-06 21:46:06,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=641, Invalid=2011, Unknown=0, NotChecked=0, Total=2652 [2018-04-06 21:46:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-06 21:46:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 206. [2018-04-06 21:46:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-06 21:46:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2018-04-06 21:46:06,778 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 36 [2018-04-06 21:46:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:06,779 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2018-04-06 21:46:06,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 21:46:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2018-04-06 21:46:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 21:46:06,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:06,780 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:46:06,780 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash 941973105, 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-06 21:46:06,786 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:06,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:06,806 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-06 21:46:06,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:46:06,828 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-06 21:46:06,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 21:46:06,863 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-06 21:46:06,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:46:06,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,876 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-06 21:46:06,877 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-06 21:46:06,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,885 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-06 21:46:06,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-06 21:46:06,897 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 23 treesize of output 18 [2018-04-06 21:46:06,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:06,902 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 18 treesize of output 25 [2018-04-06 21:46:06,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,918 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-06 21:46:06,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:06,921 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-06 21:46:06,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-06 21:46:06,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-06 21:46:06,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:06,965 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 20 treesize of output 12 [2018-04-06 21:46:06,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,978 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-06 21:46:06,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:06,981 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-06 21:46:06,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:06,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:06,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2018-04-06 21:46:07,013 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-06 21:46:07,014 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:07,367 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-06 21:46:07,402 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:07,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-06 21:46:07,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-06 21:46:07,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-06 21:46:07,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-04-06 21:46:07,403 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand 20 states. [2018-04-06 21:46:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:08,096 INFO L93 Difference]: Finished difference Result 275 states and 293 transitions. [2018-04-06 21:46:08,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-06 21:46:08,097 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-04-06 21:46:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:08,098 INFO L225 Difference]: With dead ends: 275 [2018-04-06 21:46:08,098 INFO L226 Difference]: Without dead ends: 272 [2018-04-06 21:46:08,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=842, Unknown=0, NotChecked=0, Total=1190 [2018-04-06 21:46:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-06 21:46:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 185. [2018-04-06 21:46:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-06 21:46:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 201 transitions. [2018-04-06 21:46:08,109 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 201 transitions. Word has length 36 [2018-04-06 21:46:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:08,109 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 201 transitions. [2018-04-06 21:46:08,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-06 21:46:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 201 transitions. [2018-04-06 21:46:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-06 21:46:08,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:08,110 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] [2018-04-06 21:46:08,110 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:08,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1752540301, 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-06 21:46:08,116 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:08,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:08,140 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-06 21:46:08,141 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-06 21:46:08,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-06 21:46:08,149 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-06 21:46:08,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:08,151 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-06 21:46:08,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-06 21:46:08,173 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-06 21:46:08,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:08,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, 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-06 21:46:08,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,179 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-06 21:46:08,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:3 [2018-04-06 21:46:08,216 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-06 21:46:08,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:08,233 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:46:08,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,239 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 8 treesize of output 6 [2018-04-06 21:46:08,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:08,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2018-04-06 21:46:08,284 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-06 21:46:08,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:46:08,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-04-06 21:46:08,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-06 21:46:08,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-06 21:46:08,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-04-06 21:46:08,307 INFO L87 Difference]: Start difference. First operand 185 states and 201 transitions. Second operand 14 states. [2018-04-06 21:46:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:08,876 INFO L93 Difference]: Finished difference Result 268 states and 286 transitions. [2018-04-06 21:46:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-06 21:46:08,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-04-06 21:46:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:08,877 INFO L225 Difference]: With dead ends: 268 [2018-04-06 21:46:08,877 INFO L226 Difference]: Without dead ends: 266 [2018-04-06 21:46:08,878 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=398, Invalid=1162, Unknown=0, NotChecked=0, Total=1560 [2018-04-06 21:46:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-06 21:46:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 183. [2018-04-06 21:46:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-06 21:46:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2018-04-06 21:46:08,888 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 38 [2018-04-06 21:46:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:08,888 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2018-04-06 21:46:08,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-06 21:46:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2018-04-06 21:46:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 21:46:08,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:08,889 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-06 21:46:08,889 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -814327107, 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-06 21:46:08,897 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:08,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:08,929 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-06 21:46:08,930 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:08,933 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-06 21:46:08,955 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:08,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 21:46:08,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 21:46:08,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 21:46:08,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:46:08,956 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand 5 states. [2018-04-06 21:46:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:09,040 INFO L93 Difference]: Finished difference Result 250 states and 269 transitions. [2018-04-06 21:46:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 21:46:09,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-04-06 21:46:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:09,041 INFO L225 Difference]: With dead ends: 250 [2018-04-06 21:46:09,041 INFO L226 Difference]: Without dead ends: 247 [2018-04-06 21:46:09,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 21:46:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-06 21:46:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2018-04-06 21:46:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-06 21:46:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 238 transitions. [2018-04-06 21:46:09,065 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 238 transitions. Word has length 40 [2018-04-06 21:46:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:09,065 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 238 transitions. [2018-04-06 21:46:09,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 21:46:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 238 transitions. [2018-04-06 21:46:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-06 21:46:09,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:09,067 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] [2018-04-06 21:46:09,067 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1730829593, 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-06 21:46:09,075 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:09,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:09,123 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-06 21:46:09,125 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-06 21:46:09,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,131 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-06 21:46:09,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-04-06 21:46:09,151 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-06 21:46:09,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:46:09,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-06 21:46:09,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-06 21:46:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:09,167 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:09,191 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 9 treesize of output 7 [2018-04-06 21:46:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-06 21:46:09,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:46:09,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:7 [2018-04-06 21:46:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:09,244 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:09,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 13 [2018-04-06 21:46:09,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 21:46:09,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 21:46:09,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-06 21:46:09,245 INFO L87 Difference]: Start difference. First operand 212 states and 238 transitions. Second operand 13 states. [2018-04-06 21:46:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:09,690 INFO L93 Difference]: Finished difference Result 367 states and 399 transitions. [2018-04-06 21:46:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-06 21:46:09,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-04-06 21:46:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:09,694 INFO L225 Difference]: With dead ends: 367 [2018-04-06 21:46:09,695 INFO L226 Difference]: Without dead ends: 283 [2018-04-06 21:46:09,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-04-06 21:46:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-06 21:46:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 202. [2018-04-06 21:46:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-06 21:46:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2018-04-06 21:46:09,713 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 42 [2018-04-06 21:46:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:09,713 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2018-04-06 21:46:09,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 21:46:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2018-04-06 21:46:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-06 21:46:09,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:09,713 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-06 21:46:09,713 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1243177203, 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-06 21:46:09,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:09,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:09,747 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-06 21:46:09,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, 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-06 21:46:09,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,754 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-06 21:46:09,755 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-06 21:46:09,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-06 21:46:09,776 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-06 21:46:09,777 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-06 21:46:09,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,783 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-06 21:46:09,784 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-06 21:46:09,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,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-06 21:46:09,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 21:46:09,801 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-06 21:46:09,801 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:09,833 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-06 21:46:09,834 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 5 treesize of output 3 [2018-04-06 21:46:09,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,836 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-06 21:46:09,837 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-06 21:46:09,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:09,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:46:09,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:7 [2018-04-06 21:46:09,851 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-06 21:46:09,872 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:46:09,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2018-04-06 21:46:09,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 21:46:09,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 21:46:09,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-06 21:46:09,873 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand 9 states. [2018-04-06 21:46:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:10,275 INFO L93 Difference]: Finished difference Result 296 states and 318 transitions. [2018-04-06 21:46:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-06 21:46:10,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-06 21:46:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:10,305 INFO L225 Difference]: With dead ends: 296 [2018-04-06 21:46:10,305 INFO L226 Difference]: Without dead ends: 262 [2018-04-06 21:46:10,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-04-06 21:46:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-06 21:46:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 212. [2018-04-06 21:46:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-06 21:46:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2018-04-06 21:46:10,322 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 43 [2018-04-06 21:46:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:10,322 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2018-04-06 21:46:10,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 21:46:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2018-04-06 21:46:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-06 21:46:10,322 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:10,322 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:46:10,322 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash 24642060, 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-06 21:46:10,329 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:10,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:10,371 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-06 21:46:10,373 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-06 21:46:10,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:46:10,447 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-06 21:46:10,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-06 21:46:10,465 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-06 21:46:10,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,468 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-06 21:46:10,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,520 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-06 21:46:10,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,523 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-06 21:46:10,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-06 21:46:10,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,552 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-06 21:46:10,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:40 [2018-04-06 21:46:10,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-06 21:46:10,625 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-06 21:46:10,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-06 21:46:10,666 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-06 21:46:10,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,679 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-06 21:46:10,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:60 [2018-04-06 21:46:10,697 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 66 treesize of output 54 [2018-04-06 21:46:10,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,702 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 53 treesize of output 68 [2018-04-06 21:46:10,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,726 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 43 treesize of output 46 [2018-04-06 21:46:10,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 21:46:10,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-04-06 21:46:10,833 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 92 treesize of output 69 [2018-04-06 21:46:10,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-04-06 21:46:10,837 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-06 21:46:10,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-04-06 21:46:10,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,857 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-06 21:46:10,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 49 treesize of output 39 [2018-04-06 21:46:10,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-06 21:46:10,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:10,879 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 23 treesize of output 13 [2018-04-06 21:46:10,879 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:10,896 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-06 21:46:10,897 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:108, output treesize:7 [2018-04-06 21:46:10,931 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-06 21:46:10,931 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:11,347 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:46:11,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:11,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:11,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 12 variables, input treesize:260, output treesize:1 [2018-04-06 21:46:11,370 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-06 21:46:11,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:46:11,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-04-06 21:46:11,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-06 21:46:11,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-06 21:46:11,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=434, Unknown=11, NotChecked=0, Total=506 [2018-04-06 21:46:11,406 INFO L87 Difference]: Start difference. First operand 212 states and 236 transitions. Second operand 23 states. [2018-04-06 21:46:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:46:12,835 INFO L93 Difference]: Finished difference Result 304 states and 327 transitions. [2018-04-06 21:46:12,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-06 21:46:12,835 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-04-06 21:46:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:46:12,837 INFO L225 Difference]: With dead ends: 304 [2018-04-06 21:46:12,837 INFO L226 Difference]: Without dead ends: 270 [2018-04-06 21:46:12,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=266, Invalid=1526, Unknown=14, NotChecked=0, Total=1806 [2018-04-06 21:46:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-06 21:46:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 237. [2018-04-06 21:46:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-06 21:46:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 262 transitions. [2018-04-06 21:46:12,860 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 262 transitions. Word has length 44 [2018-04-06 21:46:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:46:12,861 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 262 transitions. [2018-04-06 21:46:12,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-06 21:46:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 262 transitions. [2018-04-06 21:46:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-06 21:46:12,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:46:12,862 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] [2018-04-06 21:46:12,862 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:46:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 829633126, 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-06 21:46:12,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:46:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:46:12,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:46:12,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:12,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:46:12,918 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-06 21:46:12,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:12,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:12,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-06 21:46:12,940 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-06 21:46:12,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 21:46:12,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:12,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:12,950 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-06 21:46:12,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-06 21:46:12,976 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 43 [2018-04-06 21:46:12,979 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-06 21:46:12,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:12,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:13,001 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-06 21:46:13,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-06 21:46:13,077 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-06 21:46:13,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:46:13,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 21:46:13,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:46:13,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:13,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-06 21:46:27,177 WARN L148 SmtUtils]: Spent 14045ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-06 21:46:41,237 WARN L148 SmtUtils]: Spent 14028ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-06 21:46:41,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2018-04-06 21:46:41,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, 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-06 21:46:41,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 21:46:41,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 21:46:41,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:46:41,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-04-06 21:46:41,286 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-06 21:46:41,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,291 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-06 21:46:41,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 21:46:41,315 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-06 21:46:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:41,361 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:46:41,874 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 129 treesize of output 75 [2018-04-06 21:46:41,899 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-06 21:46:41,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,915 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 54 treesize of output 58 [2018-04-06 21:46:41,982 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 39 treesize of output 38 [2018-04-06 21:46:41,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,985 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 40 treesize of output 39 [2018-04-06 21:46:41,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-04-06 21:46:41,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:41,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 21:46:41,989 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,075 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 37 treesize of output 36 [2018-04-06 21:46:42,075 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-04-06 21:46:42,078 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-06 21:46:42,081 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,162 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 38 treesize of output 41 [2018-04-06 21:46:42,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-06 21:46:42,165 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-06 21:46:42,186 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,204 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 22 treesize of output 20 [2018-04-06 21:46:42,205 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:42,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-06 21:46:42,221 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,235 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 17 treesize of output 15 [2018-04-06 21:46:42,235 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:42,248 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 21:46:42,258 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 34 treesize of output 44 [2018-04-06 21:46:42,261 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 25 [2018-04-06 21:46:42,262 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,296 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 31 treesize of output 31 [2018-04-06 21:46:42,297 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:42,333 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 34 treesize of output 28 [2018-04-06 21:46:42,334 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,368 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 28 treesize of output 20 [2018-04-06 21:46:42,369 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-06 21:46:42,405 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:42,437 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 23 treesize of output 15 [2018-04-06 21:46:42,438 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,439 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 18 [2018-04-06 21:46:42,439 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-04-06 21:46:42,473 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:42,509 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:46:42,510 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:46:42,518 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-06 21:46:42,519 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-06 21:46:42,570 INFO L267 ElimStorePlain]: Start of recursive call 18: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-06 21:46:42,573 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 39 treesize of output 33 [2018-04-06 21:46:42,574 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 4 [2018-04-06 21:46:42,575 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-06 21:46:42,581 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,585 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,722 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 35 treesize of output 37 [2018-04-06 21:46:42,725 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 32 treesize of output 18 [2018-04-06 21:46:42,725 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,738 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 18 treesize of output 16 [2018-04-06 21:46:42,738 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:42,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-04-06 21:46:42,761 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:42,776 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 21:46:42,778 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 32 [2018-04-06 21:46:42,781 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-06 21:46:42,781 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,785 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-04-06 21:46:42,790 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-06 21:46:42,790 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:42,796 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 7 treesize of output 5 [2018-04-06 21:46:42,796 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:42,799 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:42,935 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 34 treesize of output 50 [2018-04-06 21:46:43,001 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 26 treesize of output 24 [2018-04-06 21:46:43,001 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:43,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, 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 21 [2018-04-06 21:46:43,072 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:43,078 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 28 treesize of output 28 [2018-04-06 21:46:43,078 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:43,157 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 31 treesize of output 27 [2018-04-06 21:46:43,158 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-04-06 21:46:43,236 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 24 treesize of output 18 [2018-04-06 21:46:43,236 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:43,326 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 23 treesize of output 23 [2018-04-06 21:46:43,326 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:43,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-06 21:46:43,409 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:43,411 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 22 treesize of output 20 [2018-04-06 21:46:43,411 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:43,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-04-06 21:46:43,508 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:46:43,614 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:46:43,615 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:46:43,623 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-06 21:46:43,624 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-06 21:46:43,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-04-06 21:46:43,749 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:46:43,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-04-06 21:46:43,885 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:46:44,002 INFO L267 ElimStorePlain]: Start of recursive call 40: 10 dim-1 vars, End of recursive call: 12 dim-0 vars, and 17 xjuncts. [2018-04-06 21:46:44,013 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 38 treesize of output 47 [2018-04-06 21:46:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-06 21:46:44,016 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-06 21:46:44,044 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 22 treesize of output 20 [2018-04-06 21:46:44,045 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:46:44,075 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 28 treesize of output 24 [2018-04-06 21:46:44,076 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-04-06 21:46:44,107 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 19 treesize of output 17 [2018-04-06 21:46:44,108 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:44,109 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 13 [2018-04-06 21:46:44,109 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:44,138 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 17 treesize of output 15 [2018-04-06 21:46:44,139 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:46:44,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-04-06 21:46:44,182 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:46:44,231 INFO L267 ElimStorePlain]: Start of recursive call 53: 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-06 21:46:44,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 27 dim-0 vars, and 33 xjuncts. [2018-04-06 21:46:44,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 33 xjuncts. [2018-04-06 21:46:44,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 33 xjuncts. [2018-04-06 21:46:44,967 INFO L202 ElimStorePlain]: Needed 60 recursive calls to eliminate 3 variables, input treesize:129, output treesize:422 [2018-04-06 21:46:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:46:45,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:46:45,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-04-06 21:46:45,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-06 21:46:45,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-06 21:46:45,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-04-06 21:46:45,156 INFO L87 Difference]: Start difference. First operand 237 states and 262 transitions. Second operand 26 states. [2018-04-06 21:47:09,712 WARN L151 SmtUtils]: Spent 24089ms on a formula simplification. DAG size of input: 81 DAG size of output 58 [2018-04-06 21:47:36,031 WARN L151 SmtUtils]: Spent 26066ms on a formula simplification. DAG size of input: 61 DAG size of output 39 [2018-04-06 21:48:04,271 WARN L151 SmtUtils]: Spent 28057ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-04-06 21:48:30,549 WARN L151 SmtUtils]: Spent 26077ms on a formula simplification. DAG size of input: 71 DAG size of output 42 [2018-04-06 21:48:58,647 WARN L151 SmtUtils]: Spent 28056ms on a formula simplification. DAG size of input: 51 DAG size of output 40 [2018-04-06 21:49:22,900 WARN L151 SmtUtils]: Spent 24092ms on a formula simplification. DAG size of input: 43 DAG size of output 41 [2018-04-06 21:49:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:49:23,011 INFO L93 Difference]: Finished difference Result 347 states and 370 transitions. [2018-04-06 21:49:23,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-06 21:49:23,011 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-04-06 21:49:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:49:23,012 INFO L225 Difference]: With dead ends: 347 [2018-04-06 21:49:23,012 INFO L226 Difference]: Without dead ends: 346 [2018-04-06 21:49:23,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 185.8s TimeCoverageRelationStatistics Valid=534, Invalid=1818, Unknown=0, NotChecked=0, Total=2352 [2018-04-06 21:49:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-06 21:49:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 268. [2018-04-06 21:49:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-06 21:49:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 298 transitions. [2018-04-06 21:49:23,034 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 298 transitions. Word has length 46 [2018-04-06 21:49:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:49:23,034 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 298 transitions. [2018-04-06 21:49:23,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-06 21:49:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 298 transitions. [2018-04-06 21:49:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-06 21:49:23,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:49:23,035 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] [2018-04-06 21:49:23,035 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:49:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash 829633127, 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-06 21:49:23,043 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:49:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:49:23,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:49:23,071 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-06 21:49:23,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:49:23,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:49:23,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 21:49:23,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-06 21:49:23,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 21:49:23,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:49:23,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,122 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-06 21:49:23,123 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-06 21:49:23,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,131 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-06 21:49:23,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-06 21:49:23,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-06 21:49:23,158 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-06 21:49:23,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-06 21:49:23,179 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-06 21:49:23,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,191 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-06 21:49:23,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-06 21:49:23,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-06 21:49:23,253 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-06 21:49:23,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 21:49:23,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:49:23,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-06 21:49:23,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-06 21:49:23,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-06 21:49:23,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:49:23,325 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 73 treesize of output 60 [2018-04-06 21:49:23,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-06 21:49:23,328 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:23,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-06 21:49:23,359 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-06 21:49:37,398 WARN L148 SmtUtils]: Spent 14023ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-06 21:49:51,448 WARN L148 SmtUtils]: Spent 14023ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-06 21:49:51,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-04-06 21:49:51,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-06 21:49:51,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 21:49:51,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,497 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 27 [2018-04-06 21:49:51,498 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-06 21:49:51,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,504 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-06 21:49:51,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 65 [2018-04-06 21:49:51,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-04-06 21:49:51,527 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 21:49:51,541 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-06 21:49:51,551 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:49:51,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-04-06 21:49:51,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 21:49:51,586 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,593 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-06 21:49:51,594 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,599 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-04-06 21:49:51,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 21:49:51,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-06 21:49:51,619 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-06 21:49:51,620 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:51,628 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:49:51,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:49:51,649 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-06 21:49:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:49:51,704 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:49:53,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 169 [2018-04-06 21:49:53,687 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-06 21:49:53,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:53,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 128 [2018-04-06 21:49:53,786 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 109 treesize of output 108 [2018-04-06 21:49:53,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:53,788 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 114 treesize of output 113 [2018-04-06 21:49:53,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:53,790 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 113 treesize of output 112 [2018-04-06 21:49:53,790 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:53,792 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 185 treesize of output 184 [2018-04-06 21:49:53,792 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:53,929 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 106 treesize of output 101 [2018-04-06 21:49:53,930 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:53,933 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 104 treesize of output 101 [2018-04-06 21:49:53,933 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:53,936 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 107 treesize of output 102 [2018-04-06 21:49:53,936 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:54,055 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 113 treesize of output 109 [2018-04-06 21:49:54,057 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 95 treesize of output 52 [2018-04-06 21:49:54,058 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:54,081 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 100 treesize of output 59 [2018-04-06 21:49:54,082 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-06 21:49:54,094 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:49:54,110 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 108 treesize of output 120 [2018-04-06 21:49:54,297 WARN L148 SmtUtils]: Spent 183ms on a formula simplification that was a NOOP. DAG size: 159 [2018-04-06 21:49:54,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 72 [2018-04-06 21:49:54,317 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:49:54,574 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 96 treesize of output 94 [2018-04-06 21:49:54,575 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:54,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:49:54,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:49:54,839 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 70 [2018-04-06 21:49:54,840 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-06 21:49:55,075 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 98 treesize of output 63 [2018-04-06 21:49:55,075 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:49:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 53 [2018-04-06 21:49:55,103 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:55,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 75 [2018-04-06 21:49:55,347 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:49:55,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 75 [2018-04-06 21:49:55,610 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:49:55,855 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 94 treesize of output 53 [2018-04-06 21:49:55,856 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:56,067 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 101 treesize of output 99 [2018-04-06 21:49:56,068 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:56,272 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 99 treesize of output 60 [2018-04-06 21:49:56,273 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-06 21:49:56,479 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 93 treesize of output 58 [2018-04-06 21:49:56,480 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:49:56,657 INFO L267 ElimStorePlain]: Start of recursive call 15: 10 dim-1 vars, End of recursive call: 12 dim-0 vars, and 17 xjuncts. [2018-04-06 21:49:56,669 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 112 treesize of output 117 [2018-04-06 21:49:56,672 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 98 treesize of output 96 [2018-04-06 21:49:56,673 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:56,724 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 1 case distinctions, treesize of input 100 treesize of output 59 [2018-04-06 21:49:56,725 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-04-06 21:49:56,781 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 92 treesize of output 55 [2018-04-06 21:49:56,782 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:49:56,837 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 93 treesize of output 50 [2018-04-06 21:49:56,837 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:56,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 72 [2018-04-06 21:49:56,901 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-06 21:49:56,979 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 50 treesize of output 48 [2018-04-06 21:49:56,980 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:56,986 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 54 treesize of output 52 [2018-04-06 21:49:56,987 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:57,060 INFO L267 ElimStorePlain]: Start of recursive call 27: 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-06 21:49:57,480 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 101 treesize of output 103 [2018-04-06 21:49:57,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2018-04-06 21:49:57,483 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:57,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 97 [2018-04-06 21:49:57,519 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:49:57,555 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 96 treesize of output 82 [2018-04-06 21:49:57,555 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:57,581 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 21:49:57,584 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 101 treesize of output 98 [2018-04-06 21:49:57,586 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 73 treesize of output 71 [2018-04-06 21:49:57,586 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:57,597 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-06 21:49:57,597 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:57,603 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:58,008 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 112 treesize of output 111 [2018-04-06 21:49:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2018-04-06 21:49:58,011 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:58,036 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 101 treesize of output 93 [2018-04-06 21:49:58,037 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,058 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 100 treesize of output 92 [2018-04-06 21:49:58,059 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,093 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 93 treesize of output 50 [2018-04-06 21:49:58,093 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 55 [2018-04-06 21:49:58,117 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:49:58,137 INFO L267 ElimStorePlain]: Start of recursive call 42: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 21:49:58,150 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 108 treesize of output 114 [2018-04-06 21:49:58,153 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 104 treesize of output 96 [2018-04-06 21:49:58,153 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,215 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 101 treesize of output 101 [2018-04-06 21:49:58,216 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-06 21:49:58,285 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:49:58,287 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:49:58,297 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 70 [2018-04-06 21:49:58,298 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-06 21:49:58,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 96 treesize of output 55 [2018-04-06 21:49:58,401 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,490 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 55 treesize of output 53 [2018-04-06 21:49:58,490 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:49:58,580 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 101 treesize of output 66 [2018-04-06 21:49:58,581 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 21:49:58,669 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 96 treesize of output 55 [2018-04-06 21:49:58,669 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 50 [2018-04-06 21:49:58,671 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,747 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 58 treesize of output 50 [2018-04-06 21:49:58,748 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,749 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 61 treesize of output 53 [2018-04-06 21:49:58,749 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-06 21:49:58,821 INFO L267 ElimStorePlain]: Start of recursive call 48: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-06 21:49:59,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 27 dim-0 vars, and 33 xjuncts. [2018-04-06 21:49:59,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 33 xjuncts. [2018-04-06 21:50:00,264 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 127 treesize of output 105 [2018-04-06 21:50:00,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-06 21:50:00,266 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:00,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 112 [2018-04-06 21:50:00,355 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 32 treesize of output 40 [2018-04-06 21:50:00,356 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:00,364 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 62 treesize of output 70 [2018-04-06 21:50:00,364 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:00,436 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 63 treesize of output 62 [2018-04-06 21:50:00,436 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:00,437 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 33 treesize of output 32 [2018-04-06 21:50:00,437 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:00,509 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:50:00,519 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 2 case distinctions, treesize of input 62 treesize of output 73 [2018-04-06 21:50:00,521 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 54 treesize of output 52 [2018-04-06 21:50:00,522 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:00,554 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 40 [2018-04-06 21:50:00,554 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:00,580 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-06 21:50:00,581 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:00,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-04-06 21:50:00,609 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:00,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 65 [2018-04-06 21:50:00,653 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:00,721 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 51 treesize of output 47 [2018-04-06 21:50:00,721 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:00,764 INFO L267 ElimStorePlain]: Start of recursive call 66: 6 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 21:50:00,778 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 32 treesize of output 48 [2018-04-06 21:50:00,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-04-06 21:50:00,846 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:00,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-06 21:50:00,922 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:00,927 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 23 treesize of output 23 [2018-04-06 21:50:00,927 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:01,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-04-06 21:50:01,013 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:01,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-04-06 21:50:01,194 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,282 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 24 treesize of output 22 [2018-04-06 21:50:01,282 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,453 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 13 [2018-04-06 21:50:01,453 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,541 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 24 treesize of output 20 [2018-04-06 21:50:01,542 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:01,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-06 21:50:01,616 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:01,685 INFO L267 ElimStorePlain]: Start of recursive call 73: 10 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-04-06 21:50:01,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:50:01,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-04-06 21:50:01,812 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-06 21:50:01,812 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,818 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-06 21:50:01,818 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,821 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,826 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 31 treesize of output 35 [2018-04-06 21:50:01,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-06 21:50:01,828 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,843 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 22 treesize of output 20 [2018-04-06 21:50:01,843 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:01,860 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 27 treesize of output 27 [2018-04-06 21:50:01,861 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:01,876 INFO L267 ElimStorePlain]: Start of recursive call 86: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:50:01,970 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 29 treesize of output 47 [2018-04-06 21:50:01,974 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 23 [2018-04-06 21:50:01,974 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:02,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-04-06 21:50:02,046 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:02,151 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 29 treesize of output 27 [2018-04-06 21:50:02,152 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:02,254 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 32 treesize of output 24 [2018-04-06 21:50:02,254 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:02,358 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 24 treesize of output 20 [2018-04-06 21:50:02,359 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:02,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-04-06 21:50:02,472 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:02,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-06 21:50:02,589 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:02,668 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 23 treesize of output 23 [2018-04-06 21:50:02,668 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:02,738 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 24 treesize of output 22 [2018-04-06 21:50:02,739 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:02,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-06 21:50:02,807 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:02,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-04-06 21:50:02,940 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:03,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-06 21:50:03,006 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-04-06 21:50:03,008 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,068 INFO L267 ElimStorePlain]: Start of recursive call 90: 13 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-04-06 21:50:03,135 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-06 21:50:03,178 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-06 21:50:03,516 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 30 [2018-04-06 21:50:03,528 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 9 treesize of output 8 [2018-04-06 21:50:03,528 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,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 16 treesize of output 12 [2018-04-06 21:50:03,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 21:50:03,533 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,534 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,536 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,538 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 30 [2018-04-06 21:50:03,550 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-06 21:50:03,550 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,554 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-06 21:50:03,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 21:50:03,556 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,556 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,558 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,560 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-06 21:50:03,572 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-06 21:50:03,573 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,576 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 16 treesize of output 12 [2018-04-06 21:50:03,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 21:50:03,578 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,578 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,580 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,793 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-04-06 21:50:03,805 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-06 21:50:03,806 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-06 21:50:03,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-06 21:50:03,820 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,825 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 21:50:03,837 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:50:03,837 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,842 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 18 treesize of output 18 [2018-04-06 21:50:03,843 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:03,847 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:50:03,852 INFO L267 ElimStorePlain]: Start of recursive call 118: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:50:03,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-04-06 21:50:03,856 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 9 treesize of output 7 [2018-04-06 21:50:03,856 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,860 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-06 21:50:03,860 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,861 INFO L267 ElimStorePlain]: Start of recursive call 123: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,872 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 39 treesize of output 52 [2018-04-06 21:50:03,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-04-06 21:50:03,875 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,912 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2018-04-06 21:50:03,955 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:50:03,955 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-04-06 21:50:03,957 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,959 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 36 treesize of output 26 [2018-04-06 21:50:03,959 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:03,985 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 27 treesize of output 27 [2018-04-06 21:50:03,986 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:03,997 INFO L267 ElimStorePlain]: Start of recursive call 128: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:50:04,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 62 [2018-04-06 21:50:04,216 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 110 DAG size of output 97 [2018-04-06 21:50:04,218 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:50:04,219 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 30 treesize of output 25 [2018-04-06 21:50:04,220 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,221 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:50:04,223 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 32 treesize of output 27 [2018-04-06 21:50:04,223 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-04-06 21:50:04,325 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 24 [2018-04-06 21:50:04,384 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:04,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 31 [2018-04-06 21:50:04,439 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 4 xjuncts. [2018-04-06 21:50:04,481 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 1 case distinctions, treesize of input 24 treesize of output 18 [2018-04-06 21:50:04,481 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:04,515 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 25 treesize of output 25 [2018-04-06 21:50:04,515 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:04,545 INFO L267 ElimStorePlain]: Start of recursive call 133: 7 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 21:50:04,587 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 9 [2018-04-06 21:50:04,588 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-04-06 21:50:04,589 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,626 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2018-04-06 21:50:04,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-04-06 21:50:04,662 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:04,663 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:50:04,663 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-04-06 21:50:04,681 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:04,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-04-06 21:50:04,742 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:04,768 INFO L267 ElimStorePlain]: Start of recursive call 143: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 21:50:04,837 INFO L267 ElimStorePlain]: Start of recursive call 126: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 21:50:04,851 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:50:04,853 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 49 treesize of output 42 [2018-04-06 21:50:04,869 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-06 21:50:04,869 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,880 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 28 treesize of output 32 [2018-04-06 21:50:04,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, 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 21 [2018-04-06 21:50:04,882 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,897 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2018-04-06 21:50:04,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-04-06 21:50:04,919 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-04-06 21:50:04,925 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:04,926 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:50:04,926 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,947 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 20 treesize of output 16 [2018-04-06 21:50:04,947 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:04,954 INFO L267 ElimStorePlain]: Start of recursive call 152: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,958 INFO L267 ElimStorePlain]: Start of recursive call 150: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,962 INFO L267 ElimStorePlain]: Start of recursive call 148: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,964 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 87 treesize of output 64 [2018-04-06 21:50:04,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-06 21:50:04,967 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:04,980 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 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-06 21:50:05,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-04-06 21:50:05,006 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,027 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 28 treesize of output 32 [2018-04-06 21:50:05,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-06 21:50:05,030 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-04-06 21:50:05,050 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,057 INFO L267 ElimStorePlain]: Start of recursive call 161: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-04-06 21:50:05,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-06 21:50:05,065 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,090 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-04-06 21:50:05,091 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,103 INFO L267 ElimStorePlain]: Start of recursive call 164: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,104 INFO L267 ElimStorePlain]: Start of recursive call 159: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,109 INFO L267 ElimStorePlain]: Start of recursive call 157: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,112 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 56 treesize of output 49 [2018-04-06 21:50:05,134 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 9 treesize of output 8 [2018-04-06 21:50:05,134 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,147 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 20 treesize of output 24 [2018-04-06 21:50:05,150 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 16 treesize of output 11 [2018-04-06 21:50:05,150 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,154 INFO L267 ElimStorePlain]: Start of recursive call 169: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,158 INFO L267 ElimStorePlain]: Start of recursive call 167: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,161 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-04-06 21:50:05,192 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-06 21:50:05,192 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,201 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 20 treesize of output 19 [2018-04-06 21:50:05,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-06 21:50:05,203 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,207 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-06 21:50:05,207 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,208 INFO L267 ElimStorePlain]: Start of recursive call 173: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,212 INFO L267 ElimStorePlain]: Start of recursive call 171: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,214 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 57 treesize of output 50 [2018-04-06 21:50:05,240 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 9 treesize of output 8 [2018-04-06 21:50:05,240 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,255 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 20 treesize of output 24 [2018-04-06 21:50:05,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-06 21:50:05,260 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,263 INFO L267 ElimStorePlain]: Start of recursive call 178: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,268 INFO L267 ElimStorePlain]: Start of recursive call 176: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,271 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-06 21:50:05,326 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 9 treesize of output 8 [2018-04-06 21:50:05,326 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,339 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 20 treesize of output 19 [2018-04-06 21:50:05,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-06 21:50:05,342 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-06 21:50:05,350 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,351 INFO L267 ElimStorePlain]: Start of recursive call 182: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,357 INFO L267 ElimStorePlain]: Start of recursive call 180: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,360 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 44 treesize of output 37 [2018-04-06 21:50:05,373 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-06 21:50:05,373 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,383 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 20 treesize of output 24 [2018-04-06 21:50:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-06 21:50:05,385 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,393 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 13 treesize of output 11 [2018-04-06 21:50:05,393 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-04-06 21:50:05,404 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,409 INFO L267 ElimStorePlain]: Start of recursive call 187: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:50:05,415 INFO L267 ElimStorePlain]: Start of recursive call 185: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:50:05,419 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-06 21:50:05,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-06 21:50:05,446 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,463 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 20 treesize of output 24 [2018-04-06 21:50:05,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-06 21:50:05,466 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,470 INFO L267 ElimStorePlain]: Start of recursive call 193: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,476 INFO L267 ElimStorePlain]: Start of recursive call 191: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,479 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-06 21:50:05,504 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 9 treesize of output 8 [2018-04-06 21:50:05,504 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,522 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 20 treesize of output 24 [2018-04-06 21:50:05,525 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 19 treesize of output 13 [2018-04-06 21:50:05,525 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-06 21:50:05,536 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-06 21:50:05,544 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,546 INFO L267 ElimStorePlain]: Start of recursive call 197: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,552 INFO L267 ElimStorePlain]: Start of recursive call 195: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,555 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 79 treesize of output 56 [2018-04-06 21:50:05,558 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-06 21:50:05,558 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,569 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 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-06 21:50:05,595 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 18 treesize of output 26 [2018-04-06 21:50:05,595 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-04-06 21:50:05,621 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 27 treesize of output 25 [2018-04-06 21:50:05,621 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2018-04-06 21:50:05,657 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 36 [2018-04-06 21:50:05,707 INFO L267 ElimStorePlain]: Start of recursive call 208: End of recursive call: and 8 xjuncts. [2018-04-06 21:50:05,746 INFO L267 ElimStorePlain]: Start of recursive call 205: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-06 21:50:05,752 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 28 treesize of output 32 [2018-04-06 21:50:05,759 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 24 treesize of output 24 [2018-04-06 21:50:05,760 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,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 27 treesize of output 19 [2018-04-06 21:50:05,776 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,789 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 19 treesize of output 17 [2018-04-06 21:50:05,790 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,800 INFO L267 ElimStorePlain]: Start of recursive call 209: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:50:05,828 INFO L267 ElimStorePlain]: Start of recursive call 203: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-06 21:50:05,851 INFO L267 ElimStorePlain]: Start of recursive call 201: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 21:50:05,854 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 49 treesize of output 42 [2018-04-06 21:50:05,877 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-06 21:50:05,877 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,887 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 20 treesize of output 24 [2018-04-06 21:50:05,890 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 19 treesize of output 17 [2018-04-06 21:50:05,890 INFO L267 ElimStorePlain]: Start of recursive call 216: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,901 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 16 treesize of output 16 [2018-04-06 21:50:05,901 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 2 xjuncts. [2018-04-06 21:50:05,907 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 10 treesize of output 3 [2018-04-06 21:50:05,907 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,911 INFO L267 ElimStorePlain]: Start of recursive call 215: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:50:05,917 INFO L267 ElimStorePlain]: Start of recursive call 213: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 21:50:05,919 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-04-06 21:50:05,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-06 21:50:05,941 INFO L267 ElimStorePlain]: Start of recursive call 220: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,951 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 20 treesize of output 19 [2018-04-06 21:50:05,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-06 21:50:05,953 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,957 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 6 treesize of output 1 [2018-04-06 21:50:05,957 INFO L267 ElimStorePlain]: Start of recursive call 223: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,958 INFO L267 ElimStorePlain]: Start of recursive call 221: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:05,962 INFO L267 ElimStorePlain]: Start of recursive call 219: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:50:06,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 15 xjuncts. [2018-04-06 21:50:06,059 INFO L202 ElimStorePlain]: Needed 223 recursive calls to eliminate 8 variables, input treesize:383, output treesize:120 [2018-04-06 21:50:06,152 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 13 [2018-04-06 21:50:06,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:50:06,166 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 5 xjuncts. [2018-04-06 21:50:06,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:51 [2018-04-06 21:50:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:50:06,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:50:06,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-04-06 21:50:06,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-06 21:50:06,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-06 21:50:06,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-04-06 21:50:06,255 INFO L87 Difference]: Start difference. First operand 268 states and 298 transitions. Second operand 26 states. Received shutdown request... [2018-04-06 21:50:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 21:50:23,068 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 21:50:23,072 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 21:50:23,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:50:23 BoogieIcfgContainer [2018-04-06 21:50:23,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 21:50:23,073 INFO L168 Benchmark]: Toolchain (without parser) took 269872.12 ms. Allocated memory was 304.6 MB in the beginning and 594.0 MB in the end (delta: 289.4 MB). Free memory was 239.5 MB in the beginning and 548.4 MB in the end (delta: -308.9 MB). Peak memory consumption was 240.3 MB. Max. memory is 5.3 GB. [2018-04-06 21:50:23,074 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 304.6 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 21:50:23,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.86 ms. Allocated memory is still 304.6 MB. Free memory was 239.5 MB in the beginning and 211.3 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. [2018-04-06 21:50:23,074 INFO L168 Benchmark]: Boogie Preprocessor took 63.02 ms. Allocated memory is still 304.6 MB. Free memory was 211.3 MB in the beginning and 208.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:50:23,075 INFO L168 Benchmark]: RCFGBuilder took 708.73 ms. Allocated memory was 304.6 MB in the beginning and 466.6 MB in the end (delta: 162.0 MB). Free memory was 208.3 MB in the beginning and 384.6 MB in the end (delta: -176.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-04-06 21:50:23,075 INFO L168 Benchmark]: TraceAbstraction took 268752.69 ms. Allocated memory was 466.6 MB in the beginning and 594.0 MB in the end (delta: 127.4 MB). Free memory was 384.6 MB in the beginning and 548.4 MB in the end (delta: -163.8 MB). Peak memory consumption was 223.4 MB. Max. memory is 5.3 GB. [2018-04-06 21:50:23,076 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.21 ms. Allocated memory is still 304.6 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 342.86 ms. Allocated memory is still 304.6 MB. Free memory was 239.5 MB in the beginning and 211.3 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 63.02 ms. Allocated memory is still 304.6 MB. Free memory was 211.3 MB in the beginning and 208.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 708.73 ms. Allocated memory was 304.6 MB in the beginning and 466.6 MB in the end (delta: 162.0 MB). Free memory was 208.3 MB in the beginning and 384.6 MB in the end (delta: -176.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 268752.69 ms. Allocated memory was 466.6 MB in the beginning and 594.0 MB in the end (delta: 127.4 MB). Free memory was 384.6 MB in the beginning and 548.4 MB in the end (delta: -163.8 MB). Peak memory consumption was 223.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 15 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 159 locations, 57 error locations. TIMEOUT Result, 268.6s OverallTime, 26 OverallIterations, 2 TraceHistogramMax, 186.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2704 SDtfs, 10682 SDslu, 10864 SDs, 0 SdLazy, 10111 SolverSat, 1360 SolverUnsat, 37 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1804 GetRequests, 1273 SyntacticMatches, 20 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 223.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 1618 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 80.6s InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1522 ConstructedInterpolants, 190 QuantifiedInterpolants, 820401 SizeOfPredicates, 284 NumberOfNonLiveVariables, 3058 ConjunctsInSsa, 462 ConjunctsInUnsatCore, 52 InterpolantComputations, 40 PerfectInterpolantSequences, 10/48 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-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_21-50-23-083.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_21-50-23-083.csv Completed graceful shutdown