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-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 22:45:44,566 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 22:45:44,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 22:45:44,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 22:45:44,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 22:45:44,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 22:45:44,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 22:45:44,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 22:45:44,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 22:45:44,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 22:45:44,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 22:45:44,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 22:45:44,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 22:45:44,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 22:45:44,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 22:45:44,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 22:45:44,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 22:45:44,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 22:45:44,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 22:45:44,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 22:45:44,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 22:45:44,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 22:45:44,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 22:45:44,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 22:45:44,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 22:45:44,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 22:45:44,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 22:45:44,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 22:45:44,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 22:45:44,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 22:45:44,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 22:45:44,610 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 22:45:44,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 22:45:44,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 22:45:44,635 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 22:45:44,635 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 22:45:44,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 22:45:44,636 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 22:45:44,636 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 22:45:44,636 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 22:45:44,636 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 22:45:44,637 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 22:45:44,637 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 22:45:44,637 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 22:45:44,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 22:45:44,638 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 22:45:44,638 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 22:45:44,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 22:45:44,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 22:45:44,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 22:45:44,638 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 22:45:44,638 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 22:45:44,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 22:45:44,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 22:45:44,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 22:45:44,639 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 22:45:44,639 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 22:45:44,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 22:45:44,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 22:45:44,640 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 22:45:44,640 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 22:45:44,640 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 22:45:44,640 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 22:45:44,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 22:45:44,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:44,641 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 22:45:44,642 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 22:45:44,642 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 22:45:44,642 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 22:45:44,642 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 22:45:44,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 22:45:44,683 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 22:45:44,686 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 22:45:44,688 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 22:45:44,688 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 22:45:44,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,002 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0b3d1a12c [2018-04-09 22:45:45,202 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 22:45:45,203 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 22:45:45,203 INFO L168 CDTParser]: Scanning dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,213 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 22:45:45,214 INFO L215 ultiparseSymbolTable]: [2018-04-09 22:45:45,214 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 22:45:45,214 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,214 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 22:45:45,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____ino_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____pid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_long in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____gid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____off_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____key_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ushort in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__SLL in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__clock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____clock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____loff_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__loff_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__uint in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__time_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_int in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__dev_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__id_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__register_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____timer_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____time_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__key_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_short in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____mode_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ino_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__gid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__mode_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____id_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__timer_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____off64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____dev_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fd_set in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_char in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ulong in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_short in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__off_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__div_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_long in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__uid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_char in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__size_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:45,243 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0b3d1a12c [2018-04-09 22:45:45,248 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 22:45:45,250 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 22:45:45,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 22:45:45,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 22:45:45,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 22:45:45,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f16c210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45, skipping insertion in model container [2018-04-09 22:45:45,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,274 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:45:45,307 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:45:45,484 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:45:45,539 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:45:45,547 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-09 22:45:45,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45 WrapperNode [2018-04-09 22:45:45,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 22:45:45,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 22:45:45,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 22:45:45,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 22:45:45,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... [2018-04-09 22:45:45,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 22:45:45,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 22:45:45,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 22:45:45,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 22:45:45,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 22:45:45,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 22:45:45,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 22:45:45,789 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 22:45:45,789 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 22:45:45,790 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 22:45:45,790 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 22:45:45,790 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 22:45:45,790 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 22:45:45,790 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 22:45:45,790 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 22:45:45,790 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 22:45:45,791 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 22:45:45,791 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 22:45:45,791 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 22:45:45,791 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 22:45:45,791 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 22:45:45,791 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 22:45:45,792 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 22:45:45,792 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 22:45:45,792 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 22:45:45,792 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 22:45:45,792 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 22:45:45,792 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 22:45:45,793 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 22:45:45,793 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 22:45:45,793 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 22:45:45,793 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 22:45:45,793 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 22:45:45,793 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 22:45:45,794 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 22:45:45,794 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 22:45:45,794 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 22:45:45,794 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 22:45:45,794 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 22:45:45,794 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 22:45:45,794 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 22:45:45,795 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 22:45:45,796 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 22:45:45,796 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 22:45:45,796 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 22:45:45,796 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 22:45:45,796 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 22:45:45,796 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 22:45:45,796 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 22:45:45,797 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 22:45:45,798 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 22:45:45,798 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 22:45:45,798 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-09 22:45:45,798 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 22:45:45,798 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 22:45:45,798 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-09 22:45:45,798 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 22:45:45,799 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 22:45:45,800 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 22:45:45,801 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 22:45:45,801 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 22:45:45,801 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 22:45:45,801 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 22:45:45,801 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 22:45:45,801 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 22:45:45,801 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 22:45:45,802 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 22:45:45,803 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 22:45:45,804 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 22:45:45,805 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 22:45:45,805 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 22:45:45,805 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 22:45:45,805 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 22:45:45,805 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 22:45:46,491 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 22:45:46,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:45:46 BoogieIcfgContainer [2018-04-09 22:45:46,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 22:45:46,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 22:45:46,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 22:45:46,496 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 22:45:46,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 10:45:45" (1/3) ... [2018-04-09 22:45:46,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e4ec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:45:46, skipping insertion in model container [2018-04-09 22:45:46,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:45:45" (2/3) ... [2018-04-09 22:45:46,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e4ec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:45:46, skipping insertion in model container [2018-04-09 22:45:46,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:45:46" (3/3) ... [2018-04-09 22:45:46,499 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-09 22:45:46,509 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 22:45:46,517 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-04-09 22:45:46,564 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 22:45:46,564 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 22:45:46,564 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 22:45:46,564 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 22:45:46,565 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 22:45:46,565 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 22:45:46,565 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 22:45:46,565 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 22:45:46,565 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 22:45:46,565 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 22:45:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2018-04-09 22:45:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-09 22:45:46,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:46,587 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:46,587 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1435377897, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:46,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:46,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:46,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:45:46,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:46,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:46,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:45:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:46,745 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:46,777 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:46,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:45:46,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:45:46,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:45:46,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:45:46,792 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 4 states. [2018-04-09 22:45:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:47,065 INFO L93 Difference]: Finished difference Result 313 states and 346 transitions. [2018-04-09 22:45:47,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:45:47,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-09 22:45:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:47,080 INFO L225 Difference]: With dead ends: 313 [2018-04-09 22:45:47,080 INFO L226 Difference]: Without dead ends: 204 [2018-04-09 22:45:47,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:45:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-09 22:45:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 174. [2018-04-09 22:45:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-09 22:45:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-04-09 22:45:47,130 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 9 [2018-04-09 22:45:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:47,130 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-04-09 22:45:47,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:45:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-04-09 22:45:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-09 22:45:47,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:47,132 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:47,132 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1435377896, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:47,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:47,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:47,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 6 treesize of output 5 [2018-04-09 22:45:47,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:45:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:47,176 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:47,280 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:47,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:45:47,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:45:47,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:45:47,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:45:47,284 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 6 states. [2018-04-09 22:45:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:47,494 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2018-04-09 22:45:47,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 22:45:47,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-09 22:45:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:47,497 INFO L225 Difference]: With dead ends: 180 [2018-04-09 22:45:47,497 INFO L226 Difference]: Without dead ends: 171 [2018-04-09 22:45:47,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:45:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-09 22:45:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2018-04-09 22:45:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-09 22:45:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2018-04-09 22:45:47,512 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 9 [2018-04-09 22:45:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:47,512 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2018-04-09 22:45:47,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:45:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2018-04-09 22:45:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:45:47,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:47,514 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-09 22:45:47,514 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1804372165, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:47,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:47,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:47,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:45:47,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:45:47,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:47,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:45:47,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-09 22:45:47,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 22:45:47,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-09 22:45:47,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:47,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-09 22:45:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:47,602 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:47,639 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:47,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 22:45:47,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:45:47,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:45:47,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:45:47,640 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand 5 states. [2018-04-09 22:45:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:48,042 INFO L93 Difference]: Finished difference Result 355 states and 379 transitions. [2018-04-09 22:45:48,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 22:45:48,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-09 22:45:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:48,044 INFO L225 Difference]: With dead ends: 355 [2018-04-09 22:45:48,044 INFO L226 Difference]: Without dead ends: 354 [2018-04-09 22:45:48,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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-09 22:45:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-09 22:45:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 164. [2018-04-09 22:45:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-09 22:45:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-04-09 22:45:48,058 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 18 [2018-04-09 22:45:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:48,058 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-04-09 22:45:48,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:45:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-04-09 22:45:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:45:48,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:48,059 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-09 22:45:48,059 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1804372164, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:48,067 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:48,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:48,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:45:48,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:45:48,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:48,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 10 treesize of output 9 [2018-04-09 22:45:48,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:48,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:45:48,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-09 22:45:48,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 22:45:48,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-09 22:45:48,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 22:45:48,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 22:45:48,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-09 22:45:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:48,171 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:48,220 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:48,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 22:45:48,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:45:48,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:45:48,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:45:48,221 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 8 states. [2018-04-09 22:45:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:48,551 INFO L93 Difference]: Finished difference Result 299 states and 319 transitions. [2018-04-09 22:45:48,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:45:48,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-09 22:45:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:48,552 INFO L225 Difference]: With dead ends: 299 [2018-04-09 22:45:48,553 INFO L226 Difference]: Without dead ends: 298 [2018-04-09 22:45:48,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:45:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-09 22:45:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 163. [2018-04-09 22:45:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-09 22:45:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2018-04-09 22:45:48,564 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 18 [2018-04-09 22:45:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:48,564 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2018-04-09 22:45:48,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:45:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2018-04-09 22:45:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 22:45:48,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:48,565 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:48,565 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash 327237488, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:48,571 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:48,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:48,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:48,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:48,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 22:45:48,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:48,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:45:48,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-09 22:45:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:48,629 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:48,687 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:48,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 22:45:48,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 22:45:48,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 22:45:48,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:45:48,688 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand 7 states. [2018-04-09 22:45:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:48,966 INFO L93 Difference]: Finished difference Result 239 states and 261 transitions. [2018-04-09 22:45:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:45:48,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-04-09 22:45:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:48,968 INFO L225 Difference]: With dead ends: 239 [2018-04-09 22:45:48,968 INFO L226 Difference]: Without dead ends: 222 [2018-04-09 22:45:48,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-04-09 22:45:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-09 22:45:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 160. [2018-04-09 22:45:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-09 22:45:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2018-04-09 22:45:48,977 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 25 [2018-04-09 22:45:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:48,978 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2018-04-09 22:45:48,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 22:45:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2018-04-09 22:45:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 22:45:48,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:48,979 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:48,979 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash 327237489, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:48,985 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:49,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:49,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:49,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 22:45:49,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:49,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:49,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 22:45:49,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:45:49,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-09 22:45:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:49,055 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:49,189 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:49,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 22:45:49,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:45:49,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:45:49,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:45:49,190 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 8 states. [2018-04-09 22:45:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:49,561 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2018-04-09 22:45:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:45:49,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-09 22:45:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:49,563 INFO L225 Difference]: With dead ends: 218 [2018-04-09 22:45:49,563 INFO L226 Difference]: Without dead ends: 213 [2018-04-09 22:45:49,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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-09 22:45:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-09 22:45:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 181. [2018-04-09 22:45:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-09 22:45:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 204 transitions. [2018-04-09 22:45:49,573 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 204 transitions. Word has length 25 [2018-04-09 22:45:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:49,573 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 204 transitions. [2018-04-09 22:45:49,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:45:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 204 transitions. [2018-04-09 22:45:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-09 22:45:49,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:49,574 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:49,575 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash 942614707, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:49,581 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:49,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:49,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:45:49,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:45:49,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:45:49,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:45:49,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 22:45:49,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 22:45:49,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 22:45:49,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 22:45:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:49,637 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:49,664 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:49,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 22:45:49,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:45:49,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:45:49,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:45:49,665 INFO L87 Difference]: Start difference. First operand 181 states and 204 transitions. Second operand 5 states. [2018-04-09 22:45:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:49,853 INFO L93 Difference]: Finished difference Result 280 states and 319 transitions. [2018-04-09 22:45:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:45:49,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-09 22:45:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:49,854 INFO L225 Difference]: With dead ends: 280 [2018-04-09 22:45:49,854 INFO L226 Difference]: Without dead ends: 279 [2018-04-09 22:45:49,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:45:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-09 22:45:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 180. [2018-04-09 22:45:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-09 22:45:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2018-04-09 22:45:49,864 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 27 [2018-04-09 22:45:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:49,865 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2018-04-09 22:45:49,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:45:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2018-04-09 22:45:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-09 22:45:49,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:49,865 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:49,866 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash 942614708, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:49,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:49,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:49,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:45:49,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:45:49,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:45:49,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:45:49,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:45:49,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:45:49,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:49,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-09 22:45:50,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 22:45:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 22:45:50,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:50,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:50,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 22:45:50,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 22:45:50,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:50,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:50,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:50,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-09 22:45:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:50,021 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:50,072 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:50,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 22:45:50,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:45:50,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:45:50,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:45:50,073 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand 8 states. [2018-04-09 22:45:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:50,368 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2018-04-09 22:45:50,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 22:45:50,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-04-09 22:45:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:50,406 INFO L225 Difference]: With dead ends: 293 [2018-04-09 22:45:50,406 INFO L226 Difference]: Without dead ends: 292 [2018-04-09 22:45:50,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-04-09 22:45:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-09 22:45:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 179. [2018-04-09 22:45:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-09 22:45:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 202 transitions. [2018-04-09 22:45:50,414 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 202 transitions. Word has length 27 [2018-04-09 22:45:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:50,414 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 202 transitions. [2018-04-09 22:45:50,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:45:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 202 transitions. [2018-04-09 22:45:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-09 22:45:50,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:50,416 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:50,416 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash 764978880, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:50,423 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:50,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:50,467 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:50,507 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:50,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 7 [2018-04-09 22:45:50,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:45:50,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:45:50,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:45:50,508 INFO L87 Difference]: Start difference. First operand 179 states and 202 transitions. Second operand 8 states. [2018-04-09 22:45:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:50,684 INFO L93 Difference]: Finished difference Result 235 states and 254 transitions. [2018-04-09 22:45:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 22:45:50,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-09 22:45:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:50,685 INFO L225 Difference]: With dead ends: 235 [2018-04-09 22:45:50,686 INFO L226 Difference]: Without dead ends: 228 [2018-04-09 22:45:50,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-04-09 22:45:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-09 22:45:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2018-04-09 22:45:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-09 22:45:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 210 transitions. [2018-04-09 22:45:50,696 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 210 transitions. Word has length 28 [2018-04-09 22:45:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:50,697 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 210 transitions. [2018-04-09 22:45:50,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:45:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 210 transitions. [2018-04-09 22:45:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-09 22:45:50,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:50,698 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:50,698 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 407658189, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:50,712 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:50,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:50,750 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:50,775 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:50,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 22:45:50,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:45:50,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:45:50,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:45:50,776 INFO L87 Difference]: Start difference. First operand 189 states and 210 transitions. Second operand 5 states. [2018-04-09 22:45:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:50,885 INFO L93 Difference]: Finished difference Result 266 states and 291 transitions. [2018-04-09 22:45:50,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:45:50,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-09 22:45:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:50,887 INFO L225 Difference]: With dead ends: 266 [2018-04-09 22:45:50,887 INFO L226 Difference]: Without dead ends: 216 [2018-04-09 22:45:50,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:45:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-09 22:45:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2018-04-09 22:45:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-09 22:45:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2018-04-09 22:45:50,900 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 31 [2018-04-09 22:45:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:50,901 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2018-04-09 22:45:50,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:45:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2018-04-09 22:45:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 22:45:50,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:50,902 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] [2018-04-09 22:45:50,902 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash 54052705, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:50,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:50,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:50,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:50,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:50,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 22:45:50,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:50,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:50,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 22:45:51,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:45:51,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:45:51,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-09 22:45:51,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-09 22:45:51,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:45:51,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:45:51,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-09 22:45:51,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-09 22:45:51,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-09 22:45:51,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 22:45:51,358 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:51,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:45:51,365 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-09 22:45:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:51,395 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:51,663 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:51,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2018-04-09 22:45:51,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 22:45:51,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 22:45:51,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-09 22:45:51,664 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand 14 states. [2018-04-09 22:45:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:52,195 INFO L93 Difference]: Finished difference Result 287 states and 314 transitions. [2018-04-09 22:45:52,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 22:45:52,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-09 22:45:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:52,197 INFO L225 Difference]: With dead ends: 287 [2018-04-09 22:45:52,197 INFO L226 Difference]: Without dead ends: 286 [2018-04-09 22:45:52,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2018-04-09 22:45:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-09 22:45:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 188. [2018-04-09 22:45:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-09 22:45:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-04-09 22:45:52,208 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 32 [2018-04-09 22:45:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:52,208 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-04-09 22:45:52,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 22:45:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-04-09 22:45:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 22:45:52,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:52,209 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] [2018-04-09 22:45:52,209 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:52,209 INFO L82 PathProgramCache]: Analyzing trace with hash 54052706, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:52,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:52,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:52,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:45:52,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:52,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:52,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 22:45:52,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 22:45:52,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:45:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:45:52,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:45:52,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:45:52,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-09 22:45:52,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-09 22:45:52,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:45:52,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-09 22:45:52,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:45:52,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:45:52,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-09 22:45:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-09 22:45:52,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 22:45:52,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-09 22:45:52,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-09 22:45:52,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 22:45:52,410 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 22:45:52,416 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,422 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-09 22:45:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:52,472 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:52,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-09 22:45:52,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:45:52,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-04-09 22:45:52,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-09 22:45:52,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-09 22:45:52,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:45:52,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 22:45:52,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:45:52,699 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-09 22:45:52,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-09 22:45:52,711 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,712 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,723 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:45:52,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-09 22:45:52,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:45:52,760 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 22:45:52,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 22:45:52,775 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,777 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,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 19 treesize of output 17 [2018-04-09 22:45:52,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:45:52,781 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,785 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,797 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:45:52,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 22:45:52,827 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:101, output treesize:33 [2018-04-09 22:45:52,867 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:45:52,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:52,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:1 [2018-04-09 22:45:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:52,892 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:52,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-09 22:45:52,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 22:45:52,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 22:45:52,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-09 22:45:52,893 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 18 states. [2018-04-09 22:45:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:53,628 INFO L93 Difference]: Finished difference Result 203 states and 222 transitions. [2018-04-09 22:45:53,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 22:45:53,629 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-04-09 22:45:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:53,630 INFO L225 Difference]: With dead ends: 203 [2018-04-09 22:45:53,630 INFO L226 Difference]: Without dead ends: 195 [2018-04-09 22:45:53,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=352, Invalid=908, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 22:45:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-09 22:45:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2018-04-09 22:45:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-09 22:45:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-04-09 22:45:53,642 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 32 [2018-04-09 22:45:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:53,643 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-04-09 22:45:53,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 22:45:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-04-09 22:45:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 22:45:53,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:53,644 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:53,644 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash 866826990, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:53,652 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:53,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:53,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:53,709 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:53,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 22:45:53,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:45:53,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:45:53,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:45:53,710 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 4 states. [2018-04-09 22:45:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:53,767 INFO L93 Difference]: Finished difference Result 324 states and 361 transitions. [2018-04-09 22:45:53,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:45:53,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-09 22:45:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:53,769 INFO L225 Difference]: With dead ends: 324 [2018-04-09 22:45:53,769 INFO L226 Difference]: Without dead ends: 218 [2018-04-09 22:45:53,770 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:45:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-09 22:45:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 184. [2018-04-09 22:45:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-09 22:45:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2018-04-09 22:45:53,784 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 34 [2018-04-09 22:45:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:53,784 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2018-04-09 22:45:53,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:45:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2018-04-09 22:45:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 22:45:53,785 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:53,786 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-09 22:45:53,786 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1439960181, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:53,795 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:53,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:53,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:53,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:45:53,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:53,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:53,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:53,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-09 22:45:53,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 22:45:53,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 22:45:53,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:53,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:53,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:53,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-04-09 22:45:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:53,866 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:53,929 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:53,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2018-04-09 22:45:53,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 22:45:53,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 22:45:53,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:45:53,930 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand 11 states. [2018-04-09 22:45:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:54,261 INFO L93 Difference]: Finished difference Result 373 states and 405 transitions. [2018-04-09 22:45:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 22:45:54,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-04-09 22:45:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:54,263 INFO L225 Difference]: With dead ends: 373 [2018-04-09 22:45:54,263 INFO L226 Difference]: Without dead ends: 372 [2018-04-09 22:45:54,264 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2018-04-09 22:45:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-09 22:45:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 202. [2018-04-09 22:45:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-09 22:45:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2018-04-09 22:45:54,274 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 36 [2018-04-09 22:45:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:54,274 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2018-04-09 22:45:54,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 22:45:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2018-04-09 22:45:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 22:45:54,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:54,275 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:45:54,275 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1439960180, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:54,285 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:54,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:54,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:54,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:45:54,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:54,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:54,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:54,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-09 22:45:54,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 22:45:54,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 22:45:54,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:54,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:54,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:54,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-09 22:45:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:54,532 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:54,645 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:54,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 11 [2018-04-09 22:45:54,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 22:45:54,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 22:45:54,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:45:54,646 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand 11 states. [2018-04-09 22:45:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:55,261 INFO L93 Difference]: Finished difference Result 617 states and 680 transitions. [2018-04-09 22:45:55,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 22:45:55,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-04-09 22:45:55,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:55,264 INFO L225 Difference]: With dead ends: 617 [2018-04-09 22:45:55,264 INFO L226 Difference]: Without dead ends: 499 [2018-04-09 22:45:55,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2018-04-09 22:45:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-09 22:45:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 217. [2018-04-09 22:45:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-09 22:45:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 239 transitions. [2018-04-09 22:45:55,282 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 239 transitions. Word has length 36 [2018-04-09 22:45:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:55,283 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 239 transitions. [2018-04-09 22:45:55,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 22:45:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 239 transitions. [2018-04-09 22:45:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-09 22:45:55,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:55,284 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] [2018-04-09 22:45:55,284 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash -979558141, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:55,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:55,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:55,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:55,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:55,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 22:45:55,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-09 22:45:55,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:55,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:45:55,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-09 22:45:55,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-09 22:45:55,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:45:55,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:45:55,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-09 22:45:55,508 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 36 treesize of output 24 [2018-04-09 22:45:55,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-09 22:45:55,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:45:55,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,527 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-09 22:45:55,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:15 [2018-04-09 22:45:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:55,550 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:55,654 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 39 treesize of output 31 [2018-04-09 22:45:55,675 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 11 treesize of output 10 [2018-04-09 22:45:55,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 22:45:55,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:45:55,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,711 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 22 treesize of output 18 [2018-04-09 22:45:55,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-09 22:45:55,714 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:45:55,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:45:55,750 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-04-09 22:45:55,848 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:55,848 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:25, output treesize:1 [2018-04-09 22:45:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:55,890 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:55,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2018-04-09 22:45:55,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 22:45:55,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 22:45:55,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-04-09 22:45:55,892 INFO L87 Difference]: Start difference. First operand 217 states and 239 transitions. Second operand 18 states. [2018-04-09 22:45:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:45:58,014 INFO L93 Difference]: Finished difference Result 666 states and 724 transitions. [2018-04-09 22:45:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-09 22:45:58,014 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-09 22:45:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:45:58,016 INFO L225 Difference]: With dead ends: 666 [2018-04-09 22:45:58,016 INFO L226 Difference]: Without dead ends: 665 [2018-04-09 22:45:58,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=506, Invalid=1474, Unknown=0, NotChecked=0, Total=1980 [2018-04-09 22:45:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-09 22:45:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 234. [2018-04-09 22:45:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-09 22:45:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2018-04-09 22:45:58,032 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 37 [2018-04-09 22:45:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:45:58,032 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2018-04-09 22:45:58,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 22:45:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2018-04-09 22:45:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-09 22:45:58,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:45:58,033 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] [2018-04-09 22:45:58,033 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:45:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash -979558140, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:45:58,040 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:45:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:45:58,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:45:58,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:45:58,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:58,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:45:58,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 22:45:58,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-09 22:45:58,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:58,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:45:58,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:45:58,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:45:58,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-09 22:45:58,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-09 22:45:58,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:45:58,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,199 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 58 treesize of output 52 [2018-04-09 22:45:58,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:45:58,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:45:58,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-04-09 22:45:58,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-09 22:45:58,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-09 22:45:58,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:45:58,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,287 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 22 treesize of output 20 [2018-04-09 22:45:58,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:45:58,289 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 22:45:58,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,294 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,298 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:9 [2018-04-09 22:45:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:58,311 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:45:58,422 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 75 treesize of output 67 [2018-04-09 22:45:58,442 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 11 treesize of output 10 [2018-04-09 22:45:58,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 22:45:58,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:45:58,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,466 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 58 treesize of output 54 [2018-04-09 22:45:58,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-04-09 22:45:58,468 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:45:58,506 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 29 [2018-04-09 22:45:58,522 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 11 treesize of output 10 [2018-04-09 22:45:58,522 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-09 22:45:58,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-04-09 22:45:58,531 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,532 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,536 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:45:58,567 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 52 treesize of output 43 [2018-04-09 22:45:58,586 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 11 treesize of output 10 [2018-04-09 22:45:58,586 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,594 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 10 treesize of output 8 [2018-04-09 22:45:58,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:45:58,596 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,597 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,610 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,613 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 45 treesize of output 36 [2018-04-09 22:45:58,629 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 11 treesize of output 10 [2018-04-09 22:45:58,629 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,638 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 24 treesize of output 20 [2018-04-09 22:45:58,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-09 22:45:58,641 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,643 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,647 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-09 22:45:58,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 22:45:58,674 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,682 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 20 [2018-04-09 22:45:58,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 7 [2018-04-09 22:45:58,687 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,689 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,693 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 22:45:58,722 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 5 variables, input treesize:113, output treesize:39 [2018-04-09 22:45:58,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 22:45:58,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-09 22:45:58,823 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:45:58,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:45:58,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-04-09 22:45:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:45:58,857 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:45:58,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2018-04-09 22:45:58,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 22:45:58,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 22:45:58,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-04-09 22:45:58,858 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand 18 states. [2018-04-09 22:46:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:46:00,217 INFO L93 Difference]: Finished difference Result 641 states and 697 transitions. [2018-04-09 22:46:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-09 22:46:00,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-09 22:46:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:46:00,219 INFO L225 Difference]: With dead ends: 641 [2018-04-09 22:46:00,219 INFO L226 Difference]: Without dead ends: 640 [2018-04-09 22:46:00,220 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=422, Invalid=1300, Unknown=0, NotChecked=0, Total=1722 [2018-04-09 22:46:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-04-09 22:46:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 234. [2018-04-09 22:46:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-09 22:46:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 259 transitions. [2018-04-09 22:46:00,234 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 259 transitions. Word has length 37 [2018-04-09 22:46:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:46:00,234 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 259 transitions. [2018-04-09 22:46:00,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 22:46:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 259 transitions. [2018-04-09 22:46:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 22:46:00,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:46:00,235 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:46:00,235 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:46:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1641508119, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:46:00,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:46:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:46:00,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:46:00,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:46:00,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:46:00,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:46:00,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:46:00,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-09 22:46:00,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 22:46:00,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-09 22:46:00,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-09 22:46:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:00,298 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:46:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:00,323 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:46:00,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 22:46:00,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:46:00,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:46:00,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:46:00,323 INFO L87 Difference]: Start difference. First operand 234 states and 259 transitions. Second operand 5 states. [2018-04-09 22:46:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:46:00,504 INFO L93 Difference]: Finished difference Result 387 states and 427 transitions. [2018-04-09 22:46:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 22:46:00,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-04-09 22:46:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:46:00,506 INFO L225 Difference]: With dead ends: 387 [2018-04-09 22:46:00,506 INFO L226 Difference]: Without dead ends: 386 [2018-04-09 22:46:00,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 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-09 22:46:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-09 22:46:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 233. [2018-04-09 22:46:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-09 22:46:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2018-04-09 22:46:00,529 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 40 [2018-04-09 22:46:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:46:00,530 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2018-04-09 22:46:00,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:46:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2018-04-09 22:46:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 22:46:00,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:46:00,531 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:46:00,531 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:46:00,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1641508118, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:46:00,542 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:46:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:46:00,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:46:00,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:46:00,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:46:00,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:46:00,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:46:00,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:46:00,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:46:00,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-09 22:46:00,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 22:46:00,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-09 22:46:00,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 22:46:00,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 22:46:00,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:00,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-09 22:46:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:00,683 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:46:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:00,761 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:46:00,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 22:46:00,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 22:46:00,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 22:46:00,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 22:46:00,762 INFO L87 Difference]: Start difference. First operand 233 states and 258 transitions. Second operand 8 states. [2018-04-09 22:46:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:46:01,256 INFO L93 Difference]: Finished difference Result 382 states and 424 transitions. [2018-04-09 22:46:01,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:46:01,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-04-09 22:46:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:46:01,258 INFO L225 Difference]: With dead ends: 382 [2018-04-09 22:46:01,258 INFO L226 Difference]: Without dead ends: 381 [2018-04-09 22:46:01,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:46:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-09 22:46:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 232. [2018-04-09 22:46:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-09 22:46:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 257 transitions. [2018-04-09 22:46:01,272 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 257 transitions. Word has length 40 [2018-04-09 22:46:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:46:01,272 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 257 transitions. [2018-04-09 22:46:01,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 22:46:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 257 transitions. [2018-04-09 22:46:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 22:46:01,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:46:01,273 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:46:01,273 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:46:01,274 INFO L82 PathProgramCache]: Analyzing trace with hash -318375611, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:46:01,281 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:46:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:46:01,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:46:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:01,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:46:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:01,353 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:46:01,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 22:46:01,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:46:01,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:46:01,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:46:01,353 INFO L87 Difference]: Start difference. First operand 232 states and 257 transitions. Second operand 4 states. [2018-04-09 22:46:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:46:01,375 INFO L93 Difference]: Finished difference Result 354 states and 390 transitions. [2018-04-09 22:46:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:46:01,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-04-09 22:46:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:46:01,376 INFO L225 Difference]: With dead ends: 354 [2018-04-09 22:46:01,376 INFO L226 Difference]: Without dead ends: 253 [2018-04-09 22:46:01,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:46:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-09 22:46:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 236. [2018-04-09 22:46:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-09 22:46:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 261 transitions. [2018-04-09 22:46:01,391 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 261 transitions. Word has length 51 [2018-04-09 22:46:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:46:01,391 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 261 transitions. [2018-04-09 22:46:01,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:46:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 261 transitions. [2018-04-09 22:46:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-09 22:46:01,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:46:01,392 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:46:01,392 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:46:01,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1787265824, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:46:01,406 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:46:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:46:01,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:46:01,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:46:01,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-09 22:46:01,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:46:01,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:46:01,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-09 22:46:01,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 22:46:01,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 22:46:01,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 22:46:01,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 22:46:01,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-04-09 22:46:01,561 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-09 22:46:01,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 22:46:01,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,616 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-09 22:46:01,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:01,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 22:46:01,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,636 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-04-09 22:46:01,665 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 29 treesize of output 21 [2018-04-09 22:46:01,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-04-09 22:46:01,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,675 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 29 treesize of output 21 [2018-04-09 22:46:01,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-04-09 22:46:01,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2018-04-09 22:46:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:01,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:46:01,744 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:46:01,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:01,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:1 [2018-04-09 22:46:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:01,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:46:01,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2018-04-09 22:46:01,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 22:46:01,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 22:46:01,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-09 22:46:01,776 INFO L87 Difference]: Start difference. First operand 236 states and 261 transitions. Second operand 13 states. [2018-04-09 22:46:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:46:02,291 INFO L93 Difference]: Finished difference Result 450 states and 490 transitions. [2018-04-09 22:46:02,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 22:46:02,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-04-09 22:46:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:46:02,293 INFO L225 Difference]: With dead ends: 450 [2018-04-09 22:46:02,293 INFO L226 Difference]: Without dead ends: 358 [2018-04-09 22:46:02,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2018-04-09 22:46:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-09 22:46:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 271. [2018-04-09 22:46:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-09 22:46:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 298 transitions. [2018-04-09 22:46:02,310 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 298 transitions. Word has length 53 [2018-04-09 22:46:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:46:02,310 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 298 transitions. [2018-04-09 22:46:02,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 22:46:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 298 transitions. [2018-04-09 22:46:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 22:46:02,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:46:02,311 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:46:02,311 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:46:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -101565595, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:46:02,318 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:46:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:46:02,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:46:02,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:02,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:02,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 22:46:02,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-09 22:46:02,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:46:02,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:46:02,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-09 22:46:02,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-09 22:46:02,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:46:02,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:02,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-09 22:46:02,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:02,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:02,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:02,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-09 22:46:02,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:02,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-09 22:46:02,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-09 22:46:02,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:02,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-04-09 22:46:02,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,674 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-09 22:46:02,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-09 22:46:02,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 104 [2018-04-09 22:46:02,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:46:02,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:02,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:02,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2018-04-09 22:46:02,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 105 [2018-04-09 22:46:02,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 22:46:02,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:02,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:03,025 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-09 22:46:03,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:162 [2018-04-09 22:46:03,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 95 [2018-04-09 22:46:03,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:03,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-09 22:46:03,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:03,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:03,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:03,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:102 [2018-04-09 22:46:03,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 64 [2018-04-09 22:46:03,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2018-04-09 22:46:03,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:03,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:03,256 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 31 treesize of output 20 [2018-04-09 22:46:03,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:03,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:46:03,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:03,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:03,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:03,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:28 [2018-04-09 22:46:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:03,325 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:46:04,245 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 881 treesize of output 412 [2018-04-09 22:46:04,252 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 11 treesize of output 10 [2018-04-09 22:46:04,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,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 340 treesize of output 206 [2018-04-09 22:46:04,292 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 192 treesize of output 191 [2018-04-09 22:46:04,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:04,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,335 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 191 treesize of output 191 [2018-04-09 22:46:04,335 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,372 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 188 treesize of output 115 [2018-04-09 22:46:04,410 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,410 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-04-09 22:46:04,411 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,429 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 78 treesize of output 72 [2018-04-09 22:46:04,445 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 11 treesize of output 10 [2018-04-09 22:46:04,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,461 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,464 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-04-09 22:46:04,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:04,466 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,476 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 27 treesize of output 23 [2018-04-09 22:46:04,476 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,480 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,481 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,485 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,521 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 188 treesize of output 118 [2018-04-09 22:46:04,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 33 [2018-04-09 22:46:04,559 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2018-04-09 22:46:04,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 22:46:04,602 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,611 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-04-09 22:46:04,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:46:04,617 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:04,626 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,632 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:04,632 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 27 treesize of output 17 [2018-04-09 22:46:04,632 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,635 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,637 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,638 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:04,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:04,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:04,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 22:46:04,671 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:893, output treesize:47 [2018-04-09 22:46:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:06,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:46:06,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2018-04-09 22:46:06,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-09 22:46:06,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-09 22:46:06,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1032, Unknown=2, NotChecked=0, Total=1260 [2018-04-09 22:46:06,827 INFO L87 Difference]: Start difference. First operand 271 states and 298 transitions. Second operand 36 states. [2018-04-09 22:46:13,337 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 113 DAG size of output 107 [2018-04-09 22:46:14,003 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 150 DAG size of output 87 [2018-04-09 22:46:19,408 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 136 DAG size of output 77 [2018-04-09 22:46:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:46:28,683 INFO L93 Difference]: Finished difference Result 938 states and 1003 transitions. [2018-04-09 22:46:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-09 22:46:28,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 58 [2018-04-09 22:46:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:46:28,687 INFO L225 Difference]: With dead ends: 938 [2018-04-09 22:46:28,687 INFO L226 Difference]: Without dead ends: 937 [2018-04-09 22:46:28,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4147 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=2350, Invalid=10297, Unknown=9, NotChecked=0, Total=12656 [2018-04-09 22:46:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-04-09 22:46:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 309. [2018-04-09 22:46:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-04-09 22:46:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 342 transitions. [2018-04-09 22:46:28,711 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 342 transitions. Word has length 58 [2018-04-09 22:46:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:46:28,712 INFO L459 AbstractCegarLoop]: Abstraction has 309 states and 342 transitions. [2018-04-09 22:46:28,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-09 22:46:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 342 transitions. [2018-04-09 22:46:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 22:46:28,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:46:28,713 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:46:28,713 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:46:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -101565594, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:46:28,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:46:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:46:28,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:46:28,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:46:28,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:28,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:28,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 22:46:28,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-09 22:46:28,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:46:28,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:46:28,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:46:28,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:46:28,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-09 22:46:28,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-09 22:46:28,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:46:28,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-09 22:46:28,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:46:28,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:28,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-09 22:46:28,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:28,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:28,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:28,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-09 22:46:28,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 22:46:28,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:28,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:28,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-09 22:46:29,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-04-09 22:46:29,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:29,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-04-09 22:46:29,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-04-09 22:46:29,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:29,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 22:46:29,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:29,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:97 [2018-04-09 22:46:29,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 138 [2018-04-09 22:46:29,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:46:29,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 69 [2018-04-09 22:46:29,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:46:29,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:29,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:123 [2018-04-09 22:46:29,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 131 [2018-04-09 22:46:29,438 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 16 treesize of output 23 [2018-04-09 22:46:29,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:29,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:29,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 128 [2018-04-09 22:46:29,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:29,540 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 28 [2018-04-09 22:46:29,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:29,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 123 [2018-04-09 22:46:29,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-09 22:46:29,570 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,587 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,637 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-09 22:46:29,637 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:146, output treesize:245 [2018-04-09 22:46:29,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 140 [2018-04-09 22:46:29,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:29,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-09 22:46:29,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 74 [2018-04-09 22:46:29,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:29,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-09 22:46:29,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:29,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:159, output treesize:143 [2018-04-09 22:46:29,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 93 [2018-04-09 22:46:29,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:29,932 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 15 treesize of output 6 [2018-04-09 22:46:29,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:46:29,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:29,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-04-09 22:46:29,966 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:29,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:29,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2018-04-09 22:46:29,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:46:29,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:30,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:46:30,002 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-09 22:46:30,002 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:30,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 11 treesize of output 3 [2018-04-09 22:46:30,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:30,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:30,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:30,014 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:142, output treesize:18 [2018-04-09 22:46:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:30,065 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:46:49,501 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 1323 treesize of output 1174 [2018-04-09 22:46:49,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 22:46:49,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:49,565 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 1161 treesize of output 1123 [2018-04-09 22:46:49,570 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 1109 treesize of output 1108 [2018-04-09 22:46:49,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:49,680 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 1108 treesize of output 1116 [2018-04-09 22:46:49,680 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:49,797 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 1108 treesize of output 1083 [2018-04-09 22:46:49,800 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:49,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-04-09 22:46:49,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:49,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:49,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1081 treesize of output 1095 [2018-04-09 22:46:50,027 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 129 DAG size of output 103 [2018-04-09 22:46:50,030 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 784 treesize of output 783 [2018-04-09 22:46:50,031 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,111 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 777 treesize of output 785 [2018-04-09 22:46:50,112 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:50,196 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 778 treesize of output 771 [2018-04-09 22:46:50,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 22:46:50,204 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:50,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:50,226 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 750 treesize of output 737 [2018-04-09 22:46:50,227 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,240 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:50,245 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 776 treesize of output 771 [2018-04-09 22:46:50,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:50,248 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:50,276 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 750 treesize of output 737 [2018-04-09 22:46:50,276 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,286 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,342 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:50,355 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 774 treesize of output 778 [2018-04-09 22:46:50,358 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 773 treesize of output 765 [2018-04-09 22:46:50,359 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,401 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:50,403 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 764 treesize of output 751 [2018-04-09 22:46:50,404 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,446 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 746 treesize of output 742 [2018-04-09 22:46:50,447 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:50,485 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:50,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 759 treesize of output 746 [2018-04-09 22:46:50,487 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,519 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 741 treesize of output 735 [2018-04-09 22:46:50,519 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,547 INFO L267 ElimStorePlain]: Start of recursive call 18: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:50,570 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:50,696 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 1108 treesize of output 1098 [2018-04-09 22:46:50,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:50,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 1082 treesize of output 1095 [2018-04-09 22:46:50,728 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:50,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:50,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 1084 treesize of output 1112 [2018-04-09 22:46:50,883 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:51,079 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,083 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 1081 treesize of output 1075 [2018-04-09 22:46:51,129 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 11 treesize of output 10 [2018-04-09 22:46:51,129 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:51,147 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 766 treesize of output 768 [2018-04-09 22:46:51,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 750 treesize of output 737 [2018-04-09 22:46:51,155 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:51,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 8 treesize of output 1 [2018-04-09 22:46:51,167 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:51,169 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:51,178 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:51,181 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,188 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 1085 treesize of output 1079 [2018-04-09 22:46:51,235 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 11 treesize of output 10 [2018-04-09 22:46:51,235 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:51,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 774 treesize of output 774 [2018-04-09 22:46:51,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:51,262 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:51,291 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,311 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 756 treesize of output 755 [2018-04-09 22:46:51,311 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-04-09 22:46:51,351 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:51,388 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:51,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1084 treesize of output 1091 [2018-04-09 22:46:51,781 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 131 DAG size of output 105 [2018-04-09 22:46:51,787 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,796 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:51,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 779 treesize of output 845 [2018-04-09 22:46:51,843 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 8 xjuncts. [2018-04-09 22:46:52,182 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 781 treesize of output 780 [2018-04-09 22:46:52,182 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:52,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:52,454 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 780 treesize of output 785 [2018-04-09 22:46:52,542 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 759 treesize of output 751 [2018-04-09 22:46:52,543 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:52,643 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:52,656 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 759 treesize of output 758 [2018-04-09 22:46:52,657 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 4 xjuncts. [2018-04-09 22:46:52,810 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 761 treesize of output 767 [2018-04-09 22:46:52,812 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 8 xjuncts. [2018-04-09 22:46:53,066 INFO L267 ElimStorePlain]: Start of recursive call 40: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-09 22:46:53,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,325 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 782 treesize of output 773 [2018-04-09 22:46:53,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 22:46:53,334 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,382 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 756 treesize of output 755 [2018-04-09 22:46:53,383 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-04-09 22:46:53,440 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-09 22:46:53,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,444 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 782 treesize of output 775 [2018-04-09 22:46:53,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2018-04-09 22:46:53,452 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,488 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,490 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 750 treesize of output 737 [2018-04-09 22:46:53,491 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:53,517 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,520 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,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 0 case distinctions, treesize of input 790 treesize of output 779 [2018-04-09 22:46:53,528 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,545 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 768 treesize of output 775 [2018-04-09 22:46:53,546 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 4 xjuncts. [2018-04-09 22:46:53,625 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 761 treesize of output 753 [2018-04-09 22:46:53,626 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,639 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 767 treesize of output 751 [2018-04-09 22:46:53,640 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,656 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 764 treesize of output 752 [2018-04-09 22:46:53,657 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,748 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-09 22:46:53,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,753 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 790 treesize of output 781 [2018-04-09 22:46:53,756 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:53,758 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 762 treesize of output 749 [2018-04-09 22:46:53,758 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:53,784 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 752 treesize of output 744 [2018-04-09 22:46:53,785 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,806 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:53,974 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:46:54,059 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1081 treesize of output 1092 [2018-04-09 22:46:54,251 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 128 DAG size of output 102 [2018-04-09 22:46:54,267 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 780 treesize of output 788 [2018-04-09 22:46:54,268 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:54,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 778 treesize of output 777 [2018-04-09 22:46:54,361 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,461 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 777 treesize of output 778 [2018-04-09 22:46:54,464 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 773 treesize of output 767 [2018-04-09 22:46:54,465 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,509 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 764 treesize of output 756 [2018-04-09 22:46:54,509 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 759 [2018-04-09 22:46:54,548 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,581 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 756 treesize of output 743 [2018-04-09 22:46:54,583 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,645 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 759 treesize of output 758 [2018-04-09 22:46:54,645 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 4 xjuncts. [2018-04-09 22:46:54,707 INFO L267 ElimStorePlain]: Start of recursive call 61: 5 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:46:54,831 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 776 treesize of output 771 [2018-04-09 22:46:54,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:54,836 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,856 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,858 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 750 treesize of output 737 [2018-04-09 22:46:54,859 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,873 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 778 treesize of output 771 [2018-04-09 22:46:54,883 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:54,885 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 750 treesize of output 737 [2018-04-09 22:46:54,885 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:54,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 22:46:54,907 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:54,922 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:55,040 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:46:55,076 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:55,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1105 treesize of output 1080 [2018-04-09 22:46:55,144 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,146 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 22 [2018-04-09 22:46:55,146 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,166 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,170 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 1073 treesize of output 1067 [2018-04-09 22:46:55,211 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 11 treesize of output 10 [2018-04-09 22:46:55,211 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,231 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,232 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 766 treesize of output 761 [2018-04-09 22:46:55,236 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,239 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 750 treesize of output 741 [2018-04-09 22:46:55,239 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:55,250 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,253 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,255 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,263 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:55,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:55,472 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 595 treesize of output 446 [2018-04-09 22:46:55,476 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 11 treesize of output 10 [2018-04-09 22:46:55,476 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,526 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 433 treesize of output 395 [2018-04-09 22:46:55,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 380 [2018-04-09 22:46:55,530 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,614 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 380 treesize of output 386 [2018-04-09 22:46:55,614 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:55,722 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 380 treesize of output 370 [2018-04-09 22:46:55,880 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 108 DAG size of output 95 [2018-04-09 22:46:55,882 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 336 treesize of output 364 [2018-04-09 22:46:55,900 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:55,994 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,995 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:55,997 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 334 treesize of output 361 [2018-04-09 22:46:56,004 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:56,124 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,126 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 339 treesize of output 332 [2018-04-09 22:46:56,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:46:56,128 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,142 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,144 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 317 treesize of output 161 [2018-04-09 22:46:56,144 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,152 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,155 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 352 treesize of output 338 [2018-04-09 22:46:56,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 14 [2018-04-09 22:46:56,162 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:56,177 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,179 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 322 treesize of output 166 [2018-04-09 22:46:56,179 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,181 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 165 [2018-04-09 22:46:56,183 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,204 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:56,293 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 336 treesize of output 332 [2018-04-09 22:46:56,302 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 173 treesize of output 169 [2018-04-09 22:46:56,302 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:56,352 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 323 treesize of output 179 [2018-04-09 22:46:56,371 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 4 xjuncts. [2018-04-09 22:46:56,426 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 22:46:56,490 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 325 treesize of output 317 [2018-04-09 22:46:56,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 161 [2018-04-09 22:46:56,498 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,503 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,513 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,533 INFO L267 ElimStorePlain]: Start of recursive call 82: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,541 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,620 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 749 treesize of output 360 [2018-04-09 22:46:56,623 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 11 treesize of output 10 [2018-04-09 22:46:56,623 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,667 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 342 treesize of output 208 [2018-04-09 22:46:56,670 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 194 treesize of output 193 [2018-04-09 22:46:56,671 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,715 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 193 treesize of output 199 [2018-04-09 22:46:56,715 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,767 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 193 treesize of output 120 [2018-04-09 22:46:56,817 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-04-09 22:46:56,819 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,831 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:56,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 102 [2018-04-09 22:46:56,935 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 63 treesize of output 62 [2018-04-09 22:46:56,936 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:56,986 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 2 case distinctions, treesize of input 56 treesize of output 64 [2018-04-09 22:46:56,987 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,029 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-09 22:46:57,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:57,034 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,043 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,043 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-09 22:46:57,044 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,050 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-09 22:46:57,050 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,053 INFO L267 ElimStorePlain]: Start of recursive call 110: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,087 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,088 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 51 treesize of output 46 [2018-04-09 22:46:57,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,092 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 29 treesize of output 16 [2018-04-09 22:46:57,092 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:57,100 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,103 INFO L267 ElimStorePlain]: Start of recursive call 114: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,106 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 53 treesize of output 46 [2018-04-09 22:46:57,108 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,109 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 29 treesize of output 16 [2018-04-09 22:46:57,109 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 22:46:57,120 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,125 INFO L267 ElimStorePlain]: Start of recursive call 117: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,135 INFO L267 ElimStorePlain]: Start of recursive call 107: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,138 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,169 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 194 treesize of output 119 [2018-04-09 22:46:57,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,199 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 51 [2018-04-09 22:46:57,205 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,229 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,232 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 88 treesize of output 82 [2018-04-09 22:46:57,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 22:46:57,255 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,264 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,266 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-04-09 22:46:57,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 32 [2018-04-09 22:46:57,274 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:57,293 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,301 INFO L267 ElimStorePlain]: Start of recursive call 124: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,308 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,310 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-04-09 22:46:57,334 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 11 treesize of output 10 [2018-04-09 22:46:57,334 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,343 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,345 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-09 22:46:57,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:57,346 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-09 22:46:57,354 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,357 INFO L267 ElimStorePlain]: Start of recursive call 129: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,360 INFO L267 ElimStorePlain]: Start of recursive call 127: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,368 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,380 INFO L267 ElimStorePlain]: Start of recursive call 102: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,385 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 747 treesize of output 358 [2018-04-09 22:46:57,392 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 11 treesize of output 10 [2018-04-09 22:46:57,392 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,408 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 342 treesize of output 194 [2018-04-09 22:46:57,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 22:46:57,411 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,424 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 190 treesize of output 120 [2018-04-09 22:46:57,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 24 [2018-04-09 22:46:57,455 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,465 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 102 [2018-04-09 22:46:57,571 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 63 treesize of output 62 [2018-04-09 22:46:57,571 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,614 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 56 treesize of output 64 [2018-04-09 22:46:57,615 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-09 22:46:57,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:57,664 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:46:57,675 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,681 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,682 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,682 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 29 treesize of output 19 [2018-04-09 22:46:57,683 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,686 INFO L267 ElimStorePlain]: Start of recursive call 141: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,719 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,721 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 51 treesize of output 46 [2018-04-09 22:46:57,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:57,723 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,731 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,732 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 29 treesize of output 16 [2018-04-09 22:46:57,732 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,736 INFO L267 ElimStorePlain]: Start of recursive call 145: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,740 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 53 treesize of output 46 [2018-04-09 22:46:57,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 22:46:57,746 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,755 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,756 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 29 treesize of output 16 [2018-04-09 22:46:57,757 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,762 INFO L267 ElimStorePlain]: Start of recursive call 148: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:57,772 INFO L267 ElimStorePlain]: Start of recursive call 138: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,773 INFO L267 ElimStorePlain]: Start of recursive call 136: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,774 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,779 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,782 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 752 treesize of output 363 [2018-04-09 22:46:57,785 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 11 treesize of output 10 [2018-04-09 22:46:57,785 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,799 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 340 treesize of output 187 [2018-04-09 22:46:57,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-09 22:46:57,803 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,811 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 178 treesize of output 105 [2018-04-09 22:46:57,834 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,835 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-04-09 22:46:57,835 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,851 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 79 [2018-04-09 22:46:57,888 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 11 treesize of output 10 [2018-04-09 22:46:57,889 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,903 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-04-09 22:46:57,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,906 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,906 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 27 treesize of output 23 [2018-04-09 22:46:57,906 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:46:57,915 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,917 INFO L267 ElimStorePlain]: Start of recursive call 159: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,918 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-09 22:46:57,920 INFO L267 ElimStorePlain]: Start of recursive call 155: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,921 INFO L267 ElimStorePlain]: Start of recursive call 153: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,927 INFO L267 ElimStorePlain]: Start of recursive call 151: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,967 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 168 treesize of output 99 [2018-04-09 22:46:57,969 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 11 treesize of output 10 [2018-04-09 22:46:57,969 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:57,994 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 86 treesize of output 80 [2018-04-09 22:46:57,998 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,999 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:57,999 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 65 treesize of output 80 [2018-04-09 22:46:57,999 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,035 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 66 treesize of output 65 [2018-04-09 22:46:58,035 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,071 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 65 treesize of output 56 [2018-04-09 22:46:58,090 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-04-09 22:46:58,091 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,104 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 36 treesize of output 31 [2018-04-09 22:46:58,106 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,107 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 22 treesize of output 9 [2018-04-09 22:46:58,107 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:46:58,112 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,113 INFO L267 ElimStorePlain]: Start of recursive call 169: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,116 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-09 22:46:58,150 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 65 treesize of output 71 [2018-04-09 22:46:58,201 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,203 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 79 [2018-04-09 22:46:58,211 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,213 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 98 [2018-04-09 22:46:58,224 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,225 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:46:58,225 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,304 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,305 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 64 [2018-04-09 22:46:58,312 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,378 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 39 treesize of output 37 [2018-04-09 22:46:58,390 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,418 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 25 treesize of output 15 [2018-04-09 22:46:58,418 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,429 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,430 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,431 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-09 22:46:58,435 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,452 INFO L267 ElimStorePlain]: Start of recursive call 177: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:58,490 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 32 treesize of output 26 [2018-04-09 22:46:58,492 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,492 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 22 treesize of output 9 [2018-04-09 22:46:58,493 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,496 INFO L267 ElimStorePlain]: Start of recursive call 180: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,514 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 36 treesize of output 36 [2018-04-09 22:46:58,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-09 22:46:58,521 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,543 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 31 treesize of output 18 [2018-04-09 22:46:58,543 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,557 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 7 [2018-04-09 22:46:58,557 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,568 INFO L267 ElimStorePlain]: Start of recursive call 182: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:46:58,576 INFO L267 ElimStorePlain]: Start of recursive call 172: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,592 INFO L267 ElimStorePlain]: Start of recursive call 164: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,600 INFO L267 ElimStorePlain]: Start of recursive call 162: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:46:58,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-04-09 22:46:58,632 INFO L202 ElimStorePlain]: Needed 185 recursive calls to eliminate 14 variables, input treesize:1919, output treesize:110 [2018-04-09 22:46:58,731 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:46:58,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,736 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 11 treesize of output 15 [2018-04-09 22:46:58,745 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,745 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:46:58,745 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 12 treesize of output 10 [2018-04-09 22:46:58,746 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:46:58,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:46:58,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:64, output treesize:22 [2018-04-09 22:46:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:46:58,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:46:58,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2018-04-09 22:46:58,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-09 22:46:58,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-09 22:46:58,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1100, Unknown=10, NotChecked=0, Total=1260 [2018-04-09 22:46:58,869 INFO L87 Difference]: Start difference. First operand 309 states and 342 transitions. Second operand 36 states. [2018-04-09 22:47:02,011 WARN L151 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 185 DAG size of output 110 [2018-04-09 22:47:08,881 WARN L151 SmtUtils]: Spent 679ms on a formula simplification. DAG size of input: 216 DAG size of output 116 [2018-04-09 22:47:13,979 WARN L151 SmtUtils]: Spent 2384ms on a formula simplification. DAG size of input: 255 DAG size of output 155 [2018-04-09 22:47:30,273 WARN L151 SmtUtils]: Spent 4135ms on a formula simplification. DAG size of input: 168 DAG size of output 112 [2018-04-09 22:47:30,439 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 105 DAG size of output 90 [2018-04-09 22:47:33,076 WARN L151 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 126 DAG size of output 97 [2018-04-09 22:47:34,721 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 180 DAG size of output 125 [2018-04-09 22:47:38,057 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 178 DAG size of output 123 [2018-04-09 22:47:39,781 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 175 DAG size of output 120 [2018-04-09 22:47:46,004 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 189 DAG size of output 130 [2018-04-09 22:47:46,680 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 188 DAG size of output 111 [2018-04-09 22:47:54,500 WARN L151 SmtUtils]: Spent 1585ms on a formula simplification. DAG size of input: 283 DAG size of output 200 [2018-04-09 22:48:07,947 WARN L151 SmtUtils]: Spent 547ms on a formula simplification. DAG size of input: 151 DAG size of output 129 [2018-04-09 22:48:11,176 WARN L151 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 112 DAG size of output 90 [2018-04-09 22:48:11,440 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 200 DAG size of output 123 [2018-04-09 22:48:18,033 WARN L151 SmtUtils]: Spent 559ms on a formula simplification. DAG size of input: 136 DAG size of output 107 [2018-04-09 22:48:30,830 WARN L151 SmtUtils]: Spent 2073ms on a formula simplification. DAG size of input: 149 DAG size of output 69 [2018-04-09 22:48:33,001 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 212 DAG size of output 128 [2018-04-09 22:48:36,502 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 161 DAG size of output 115 [2018-04-09 22:48:38,725 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 105 DAG size of output 104 [2018-04-09 22:48:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:48:41,740 INFO L93 Difference]: Finished difference Result 977 states and 1054 transitions. [2018-04-09 22:48:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-09 22:48:41,741 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 58 [2018-04-09 22:48:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:48:41,743 INFO L225 Difference]: With dead ends: 977 [2018-04-09 22:48:41,743 INFO L226 Difference]: Without dead ends: 976 [2018-04-09 22:48:41,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3515 ImplicationChecksByTransitivity, 91.5s TimeCoverageRelationStatistics Valid=2165, Invalid=9572, Unknown=35, NotChecked=0, Total=11772 [2018-04-09 22:48:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-04-09 22:48:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 371. [2018-04-09 22:48:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-09 22:48:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 412 transitions. [2018-04-09 22:48:41,783 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 412 transitions. Word has length 58 [2018-04-09 22:48:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:48:41,783 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 412 transitions. [2018-04-09 22:48:41,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-09 22:48:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 412 transitions. [2018-04-09 22:48:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 22:48:41,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:48:41,784 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:48:41,784 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:48:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1498216267, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:48:41,793 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:48:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:48:41,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:48:41,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:48:41,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:48:41,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-09 22:48:41,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:41,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:41,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 22:48:41,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-09 22:48:41,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 22:48:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:48:41,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-09 22:48:41,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-09 22:48:41,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:48:41,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:41,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-09 22:48:41,932 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 29 treesize of output 19 [2018-04-09 22:48:41,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-09 22:48:41,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 22:48:41,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2018-04-09 22:48:41,970 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 23 treesize of output 24 [2018-04-09 22:48:41,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:48:41,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:41,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:41,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 22:48:42,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-09 22:48:42,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 22:48:42,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 22:48:42,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,021 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-09 22:48:42,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-09 22:48:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:48:42,045 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:48:42,228 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 40 treesize of output 32 [2018-04-09 22:48:42,239 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 11 treesize of output 10 [2018-04-09 22:48:42,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,244 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 10 treesize of output 8 [2018-04-09 22:48:42,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 22:48:42,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:6 [2018-04-09 22:48:42,263 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:48:42,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:42,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:1 [2018-04-09 22:48:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:48:42,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:48:42,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2018-04-09 22:48:42,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-09 22:48:42,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-09 22:48:42,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-04-09 22:48:42,292 INFO L87 Difference]: Start difference. First operand 371 states and 412 transitions. Second operand 27 states. [2018-04-09 22:48:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:48:45,641 INFO L93 Difference]: Finished difference Result 1052 states and 1138 transitions. [2018-04-09 22:48:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-09 22:48:45,641 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-04-09 22:48:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:48:45,643 INFO L225 Difference]: With dead ends: 1052 [2018-04-09 22:48:45,643 INFO L226 Difference]: Without dead ends: 936 [2018-04-09 22:48:45,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1592, Invalid=5890, Unknown=0, NotChecked=0, Total=7482 [2018-04-09 22:48:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-04-09 22:48:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 378. [2018-04-09 22:48:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-09 22:48:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 419 transitions. [2018-04-09 22:48:45,673 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 419 transitions. Word has length 58 [2018-04-09 22:48:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:48:45,673 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 419 transitions. [2018-04-09 22:48:45,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-09 22:48:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 419 transitions. [2018-04-09 22:48:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 22:48:45,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:48:45,674 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:48:45,674 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 22:48:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1500230611, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:48:45,680 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:48:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:48:45,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:48:45,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:45,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:45,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 22:48:45,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-09 22:48:45,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:48:45,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:48:45,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-09 22:48:45,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-09 22:48:45,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:48:45,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:45,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-09 22:48:45,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:45,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:45,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:45,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-09 22:48:45,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:45,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-09 22:48:45,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-09 22:48:45,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:45,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-04-09 22:48:45,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,883 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-09 22:48:45,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-09 22:48:45,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 104 [2018-04-09 22:48:45,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 22:48:45,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:45,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:45,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2018-04-09 22:48:46,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 105 [2018-04-09 22:48:46,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 16 treesize of output 23 [2018-04-09 22:48:46,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 22:48:46,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:48:46,140 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-09 22:48:46,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:170 [2018-04-09 22:48:46,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:46,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:46,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:46,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:46,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-04-09 22:48:46,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:46,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:46,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:91, output treesize:107 [2018-04-09 22:48:46,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 101 [2018-04-09 22:48:46,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:46,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 22:48:46,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:46,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:46,324 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-09 22:48:46,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:131 [2018-04-09 22:48:46,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 151 [2018-04-09 22:48:46,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 18 treesize of output 17 [2018-04-09 22:48:46,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:46,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:48:46,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:46,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:183, output treesize:169 [2018-04-09 22:48:46,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 104 [2018-04-09 22:48:46,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:48:46,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:46,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:48:46,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-04-09 22:48:46,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:46,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2018-04-09 22:48:46,646 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:46,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 22:48:46,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:48:46,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:46,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-09 22:48:46,676 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:163, output treesize:45 [2018-04-09 22:48:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:48:46,729 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:49:04,865 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 1171 treesize of output 543 [2018-04-09 22:49:04,868 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 11 treesize of output 10 [2018-04-09 22:49:04,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:04,907 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 542 treesize of output 312 [2018-04-09 22:49:04,911 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 298 treesize of output 297 [2018-04-09 22:49:04,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:04,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:49:04,976 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:04,976 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 297 treesize of output 297 [2018-04-09 22:49:04,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,037 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,041 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 294 treesize of output 176 [2018-04-09 22:49:05,093 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 33 [2018-04-09 22:49:05,094 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,107 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,108 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,108 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 114 [2018-04-09 22:49:05,148 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 11 treesize of output 10 [2018-04-09 22:49:05,149 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,162 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,164 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,164 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 104 [2018-04-09 22:49:05,218 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 23 treesize of output 33 [2018-04-09 22:49:05,221 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2018-04-09 22:49:05,222 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,236 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 43 [2018-04-09 22:49:05,245 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-09 22:49:05,262 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:49:05,290 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,290 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,291 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2018-04-09 22:49:05,295 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-04-09 22:49:05,296 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,307 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,308 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,308 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 30 treesize of output 20 [2018-04-09 22:49:05,308 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:49:05,315 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,319 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,320 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-04-09 22:49:05,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:49:05,326 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,339 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 15 treesize of output 5 [2018-04-09 22:49:05,339 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,346 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,347 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 30 treesize of output 20 [2018-04-09 22:49:05,347 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,352 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-04-09 22:49:05,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,361 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-09 22:49:05,365 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-09 22:49:05,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,386 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 30 treesize of output 20 [2018-04-09 22:49:05,387 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 22:49:05,400 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,409 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:49:05,417 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,418 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,419 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 173 [2018-04-09 22:49:05,485 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,486 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-04-09 22:49:05,487 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,500 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,504 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 126 treesize of output 100 [2018-04-09 22:49:05,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 22:49:05,530 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:49:05,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 90 [2018-04-09 22:49:05,613 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,620 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 36 [2018-04-09 22:49:05,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 40 [2018-04-09 22:49:05,624 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,642 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,643 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,644 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,644 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 65 [2018-04-09 22:49:05,650 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-09 22:49:05,678 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 22:49:05,709 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,710 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 62 treesize of output 53 [2018-04-09 22:49:05,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,713 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,713 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,713 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,714 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,714 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-04-09 22:49:05,715 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,729 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 28 treesize of output 24 [2018-04-09 22:49:05,729 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,736 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,738 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 58 treesize of output 51 [2018-04-09 22:49:05,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,741 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 15 treesize of output 9 [2018-04-09 22:49:05,741 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,752 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 28 treesize of output 24 [2018-04-09 22:49:05,752 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,757 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,759 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,760 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 60 treesize of output 53 [2018-04-09 22:49:05,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,763 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 28 treesize of output 24 [2018-04-09 22:49:05,764 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,774 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,775 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:49:05,775 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 15 treesize of output 9 [2018-04-09 22:49:05,775 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,780 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,788 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,790 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,794 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:49:05,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:49:05,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 22:49:05,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-09 22:49:05,817 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 7 variables, input treesize:1202, output treesize:71 [2018-04-09 22:49:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:49:05,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:49:05,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2018-04-09 22:49:05,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-09 22:49:05,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-09 22:49:05,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1405, Unknown=13, NotChecked=0, Total=1722 [2018-04-09 22:49:05,984 INFO L87 Difference]: Start difference. First operand 378 states and 419 transitions. Second operand 42 states. [2018-04-09 22:49:09,698 WARN L148 SmtUtils]: Spent 2252ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-09 22:49:14,306 WARN L148 SmtUtils]: Spent 2146ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-09 22:49:24,084 WARN L148 SmtUtils]: Spent 2109ms on a formula simplification that was a NOOP. DAG size: 102 [2018-04-09 22:49:27,141 WARN L151 SmtUtils]: Spent 2173ms on a formula simplification. DAG size of input: 91 DAG size of output 79 [2018-04-09 22:49:36,083 WARN L151 SmtUtils]: Spent 940ms on a formula simplification. DAG size of input: 111 DAG size of output 99 [2018-04-09 22:49:42,878 WARN L151 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 120 DAG size of output 108 [2018-04-09 22:49:43,797 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 118 DAG size of output 110 [2018-04-09 22:49:47,335 WARN L151 SmtUtils]: Spent 363ms on a formula simplification. DAG size of input: 94 DAG size of output 82 [2018-04-09 22:49:47,989 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 123 DAG size of output 115 [2018-04-09 22:49:49,267 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 119 DAG size of output 111 [2018-04-09 22:50:01,389 WARN L148 SmtUtils]: Spent 2137ms on a formula simplification that was a NOOP. DAG size: 123 Received shutdown request... [2018-04-09 22:50:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-09 22:50:08,796 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 22:50:08,800 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 22:50:08,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 10:50:08 BoogieIcfgContainer [2018-04-09 22:50:08,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 22:50:08,801 INFO L168 Benchmark]: Toolchain (without parser) took 263553.11 ms. Allocated memory was 304.6 MB in the beginning and 542.1 MB in the end (delta: 237.5 MB). Free memory was 241.5 MB in the beginning and 452.9 MB in the end (delta: -211.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-04-09 22:50:08,802 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 304.6 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 22:50:08,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.80 ms. Allocated memory is still 304.6 MB. Free memory was 241.5 MB in the beginning and 213.5 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:50:08,803 INFO L168 Benchmark]: Boogie Preprocessor took 61.49 ms. Allocated memory is still 304.6 MB. Free memory was 213.5 MB in the beginning and 210.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:50:08,803 INFO L168 Benchmark]: RCFGBuilder took 835.02 ms. Allocated memory was 304.6 MB in the beginning and 468.2 MB in the end (delta: 163.6 MB). Free memory was 210.5 MB in the beginning and 380.8 MB in the end (delta: -170.3 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. [2018-04-09 22:50:08,803 INFO L168 Benchmark]: TraceAbstraction took 262307.74 ms. Allocated memory was 468.2 MB in the beginning and 542.1 MB in the end (delta: 73.9 MB). Free memory was 380.8 MB in the beginning and 452.9 MB in the end (delta: -72.1 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. [2018-04-09 22:50:08,805 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.24 ms. Allocated memory is still 304.6 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 343.80 ms. Allocated memory is still 304.6 MB. Free memory was 241.5 MB in the beginning and 213.5 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 61.49 ms. Allocated memory is still 304.6 MB. Free memory was 213.5 MB in the beginning and 210.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 835.02 ms. Allocated memory was 304.6 MB in the beginning and 468.2 MB in the end (delta: 163.6 MB). Free memory was 210.5 MB in the beginning and 380.8 MB in the end (delta: -170.3 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 262307.74 ms. Allocated memory was 468.2 MB in the beginning and 542.1 MB in the end (delta: 73.9 MB). Free memory was 380.8 MB in the beginning and 452.9 MB in the end (delta: -72.1 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and interpolant automaton (currently 43 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 194 locations, 69 error locations. TIMEOUT Result, 262.2s OverallTime, 25 OverallIterations, 2 TraceHistogramMax, 200.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3884 SDtfs, 16436 SDslu, 22294 SDs, 0 SdLazy, 15615 SolverSat, 1679 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 57.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2149 GetRequests, 1456 SyntacticMatches, 5 SemanticMatches, 687 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13207 ImplicationChecksByTransitivity, 182.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=24, 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, 24 MinimizatonAttempts, 4366 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 59.8s InterpolantComputationTime, 878 NumberOfCodeBlocks, 878 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1706 ConstructedInterpolants, 319 QuantifiedInterpolants, 2212621 SizeOfPredicates, 255 NumberOfNonLiveVariables, 3155 ConjunctsInSsa, 426 ConjunctsInUnsatCore, 50 InterpolantComputations, 40 PerfectInterpolantSequences, 12/40 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-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_22-50-08-813.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_22-50-08-813.csv Completed graceful shutdown