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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 21:09:06,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 21:09:06,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 21:09:06,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 21:09:06,543 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 21:09:06,544 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 21:09:06,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 21:09:06,547 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 21:09:06,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 21:09:06,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 21:09:06,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 21:09:06,551 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 21:09:06,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 21:09:06,554 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 21:09:06,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 21:09:06,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 21:09:06,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 21:09:06,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 21:09:06,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 21:09:06,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 21:09:06,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 21:09:06,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 21:09:06,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 21:09:06,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 21:09:06,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 21:09:06,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 21:09:06,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 21:09:06,571 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 21:09:06,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 21:09:06,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 21:09:06,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 21:09:06,573 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 21:09:06,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 21:09:06,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 21:09:06,599 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 21:09:06,599 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 21:09:06,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 21:09:06,600 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 21:09:06,600 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 21:09:06,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 21:09:06,601 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 21:09:06,601 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 21:09:06,601 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 21:09:06,602 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 21:09:06,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 21:09:06,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 21:09:06,602 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 21:09:06,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 21:09:06,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 21:09:06,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 21:09:06,603 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 21:09:06,603 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 21:09:06,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 21:09:06,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 21:09:06,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 21:09:06,604 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 21:09:06,604 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 21:09:06,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 21:09:06,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:09:06,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 21:09:06,605 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 21:09:06,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 21:09:06,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 21:09:06,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 21:09:06,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:09:06,606 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 21:09:06,607 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 21:09:06,607 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 21:09:06,607 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 21:09:06,608 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 21:09:06,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 21:09:06,657 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 21:09:06,661 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 21:09:06,663 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 21:09:06,664 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 21:09:06,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,002 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcfc84e648 [2018-04-09 21:09:07,185 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 21:09:07,185 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 21:09:07,186 INFO L168 CDTParser]: Scanning dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,196 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 21:09:07,196 INFO L215 ultiparseSymbolTable]: [2018-04-09 21:09:07,196 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 21:09:07,196 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,196 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 21:09:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____WAIT_STATUS in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ushort in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_cond_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrier_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_spinlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Node in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__id_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__wchar_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_int in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____useconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_char in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_attr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pthread_list_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrierattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____swblk_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_once_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_long in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ulong in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____qaddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_short in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_condattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_set in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_long in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutex_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_short in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__size_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____intptr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____time_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutexattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__off_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__div_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__register_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__time_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__lldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Data in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____socklen_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_char in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uint in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____id_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlockattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sig_atomic_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:07,229 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcfc84e648 [2018-04-09 21:09:07,234 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 21:09:07,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 21:09:07,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 21:09:07,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 21:09:07,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 21:09:07,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65af1095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07, skipping insertion in model container [2018-04-09 21:09:07,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,262 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:09:07,293 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:09:07,463 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:09:07,512 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:09:07,520 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-09 21:09:07,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07 WrapperNode [2018-04-09 21:09:07,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 21:09:07,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 21:09:07,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 21:09:07,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 21:09:07,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (1/1) ... [2018-04-09 21:09:07,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 21:09:07,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 21:09:07,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 21:09:07,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 21:09:07,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (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 21:09:07,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 21:09:07,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 21:09:07,765 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 21:09:07,765 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 21:09:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 21:09:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 21:09:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 21:09:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 21:09:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 21:09:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 21:09:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 21:09:07,767 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 21:09:07,767 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 21:09:07,767 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 21:09:07,767 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 21:09:07,767 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 21:09:07,767 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 21:09:07,768 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 21:09:07,768 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 21:09:07,768 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 21:09:07,768 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 21:09:07,768 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 21:09:07,768 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 21:09:07,769 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 21:09:07,769 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 21:09:07,769 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 21:09:07,769 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 21:09:07,769 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 21:09:07,769 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 21:09:07,769 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 21:09:07,770 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 21:09:07,770 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 21:09:07,770 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 21:09:07,770 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 21:09:07,770 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 21:09:07,770 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 21:09:07,770 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 21:09:07,771 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 21:09:07,772 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 21:09:07,773 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 21:09:07,774 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 21:09:07,775 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 21:09:07,776 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 21:09:07,776 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 21:09:07,776 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 21:09:07,776 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 21:09:07,776 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 21:09:07,776 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 21:09:07,776 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 21:09:07,777 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 21:09:07,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 21:09:07,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 21:09:08,169 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 21:09:08,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:09:08 BoogieIcfgContainer [2018-04-09 21:09:08,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 21:09:08,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 21:09:08,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 21:09:08,172 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 21:09:08,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 09:09:07" (1/3) ... [2018-04-09 21:09:08,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:09:08, skipping insertion in model container [2018-04-09 21:09:08,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:09:07" (2/3) ... [2018-04-09 21:09:08,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:09:08, skipping insertion in model container [2018-04-09 21:09:08,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:09:08" (3/3) ... [2018-04-09 21:09:08,175 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-04-09 21:09:08,182 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 21:09:08,188 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-04-09 21:09:08,235 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 21:09:08,236 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 21:09:08,236 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 21:09:08,236 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 21:09:08,236 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 21:09:08,236 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 21:09:08,236 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 21:09:08,236 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 21:09:08,236 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 21:09:08,237 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 21:09:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-04-09 21:09:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-09 21:09:08,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:08,258 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:08,259 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1298363538, 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 21:09:08,279 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:08,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:08,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:09:08,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:08,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:08,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:09:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:08,390 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:08,425 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:08,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:09:08,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:09:08,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:09:08,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:09:08,439 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-04-09 21:09:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:08,646 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-04-09 21:09:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:09:08,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-04-09 21:09:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:08,656 INFO L225 Difference]: With dead ends: 145 [2018-04-09 21:09:08,656 INFO L226 Difference]: Without dead ends: 102 [2018-04-09 21:09:08,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 21:09:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-09 21:09:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2018-04-09 21:09:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-09 21:09:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-09 21:09:08,699 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2018-04-09 21:09:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:08,699 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-09 21:09:08,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:09:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-09 21:09:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-09 21:09:08,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:08,700 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:08,700 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1298363537, 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 21:09:08,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:08,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:08,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:09:08,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:08,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:08,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:09:08,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 21:09:08,750 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:08,772 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 21:09:08,793 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:08,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:09:08,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:09:08,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:09:08,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:09:08,796 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-04-09 21:09:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:09,027 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-04-09 21:09:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:09:09,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-04-09 21:09:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:09,030 INFO L225 Difference]: With dead ends: 157 [2018-04-09 21:09:09,030 INFO L226 Difference]: Without dead ends: 154 [2018-04-09 21:09:09,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:09:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-09 21:09:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 69. [2018-04-09 21:09:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-09 21:09:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-04-09 21:09:09,042 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 11 [2018-04-09 21:09:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:09,042 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-04-09 21:09:09,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:09:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-04-09 21:09:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 21:09:09,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:09,043 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] [2018-04-09 21:09:09,043 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1953155203, 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 21:09:09,061 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:09,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:09,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:09,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:09,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:09,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:09:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:09,130 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:09,142 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 21:09:09,175 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:09,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:09:09,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:09:09,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:09:09,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:09:09,177 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-04-09 21:09:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:09,275 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-04-09 21:09:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:09:09,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-09 21:09:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:09,277 INFO L225 Difference]: With dead ends: 111 [2018-04-09 21:09:09,277 INFO L226 Difference]: Without dead ends: 110 [2018-04-09 21:09:09,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 21:09:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-09 21:09:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 68. [2018-04-09 21:09:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-09 21:09:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-09 21:09:09,282 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 21 [2018-04-09 21:09:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:09,283 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-09 21:09:09,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:09:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-09 21:09:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 21:09:09,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:09,283 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] [2018-04-09 21:09:09,284 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1953155202, 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 21:09:09,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:09,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:09,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:09,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:09,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:09,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:09:09,338 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 21:09:09,338 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:09,378 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 21:09:09,401 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:09,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:09:09,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:09:09,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:09:09,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:09:09,402 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-04-09 21:09:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:09,539 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-04-09 21:09:09,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:09:09,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-09 21:09:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:09,541 INFO L225 Difference]: With dead ends: 126 [2018-04-09 21:09:09,541 INFO L226 Difference]: Without dead ends: 124 [2018-04-09 21:09:09,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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 21:09:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-09 21:09:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 66. [2018-04-09 21:09:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-09 21:09:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-04-09 21:09:09,552 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2018-04-09 21:09:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:09,552 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-04-09 21:09:09,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:09:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-04-09 21:09:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-09 21:09:09,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:09,553 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:09,554 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash -505999511, 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 21:09:09,563 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:09,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:09,605 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 21:09:09,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:09,612 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 21:09:09,641 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:09,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:09:09,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:09:09,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:09:09,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:09:09,642 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2018-04-09 21:09:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:09,779 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-09 21:09:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:09:09,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-09 21:09:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:09,781 INFO L225 Difference]: With dead ends: 123 [2018-04-09 21:09:09,781 INFO L226 Difference]: Without dead ends: 120 [2018-04-09 21:09:09,781 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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 21:09:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-09 21:09:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2018-04-09 21:09:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-09 21:09:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-09 21:09:09,790 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 22 [2018-04-09 21:09:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:09,790 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-09 21:09:09,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:09:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-09 21:09:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-09 21:09:09,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:09,791 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:09,792 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash -505998677, 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 21:09:09,801 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:09,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:09,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 21:09:09,830 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:09,834 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 21:09:09,855 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:09,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:09:09,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:09:09,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:09:09,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:09:09,856 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 4 states. [2018-04-09 21:09:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:09,911 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-04-09 21:09:09,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:09:09,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-09 21:09:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:09,912 INFO L225 Difference]: With dead ends: 88 [2018-04-09 21:09:09,912 INFO L226 Difference]: Without dead ends: 85 [2018-04-09 21:09:09,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:09:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-09 21:09:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-04-09 21:09:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-09 21:09:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-04-09 21:09:09,917 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 22 [2018-04-09 21:09:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:09,918 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-04-09 21:09:09,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:09:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-04-09 21:09:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-09 21:09:09,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:09,918 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:09,918 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash -505998676, 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 21:09:09,926 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:09,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:09,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:09,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:09,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:09,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:09:09,976 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 21:09:09,976 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:10,015 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 21:09:10,036 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:10,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 8 [2018-04-09 21:09:10,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:09:10,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:09:10,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:09:10,037 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 9 states. [2018-04-09 21:09:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:10,303 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-04-09 21:09:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:09:10,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-09 21:09:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:10,305 INFO L225 Difference]: With dead ends: 248 [2018-04-09 21:09:10,305 INFO L226 Difference]: Without dead ends: 243 [2018-04-09 21:09:10,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:09:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-09 21:09:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 107. [2018-04-09 21:09:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-09 21:09:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-04-09 21:09:10,316 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 22 [2018-04-09 21:09:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:10,316 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-04-09 21:09:10,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:09:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-04-09 21:09:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-09 21:09:10,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:10,318 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 21:09:10,318 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash 469306275, 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 21:09:10,324 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:10,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:10,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:10,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:09:10,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:10,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:10,389 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 21:09:10,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:10,397 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 12 treesize of output 21 [2018-04-09 21:09:10,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,403 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 21:09:10,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-09 21:09:10,418 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 21:09:10,419 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:10,474 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:09:10,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,485 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:10,485 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:10,486 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 13 treesize of output 3 [2018-04-09 21:09:10,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:09:10,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-04-09 21:09:10,549 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 21:09:10,581 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:10,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-09 21:09:10,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 21:09:10,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 21:09:10,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:09:10,583 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 10 states. [2018-04-09 21:09:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:10,832 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-04-09 21:09:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 21:09:10,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-04-09 21:09:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:10,834 INFO L225 Difference]: With dead ends: 153 [2018-04-09 21:09:10,834 INFO L226 Difference]: Without dead ends: 151 [2018-04-09 21:09:10,834 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:09:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-09 21:09:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2018-04-09 21:09:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-09 21:09:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-04-09 21:09:10,843 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 27 [2018-04-09 21:09:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:10,843 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-04-09 21:09:10,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 21:09:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-04-09 21:09:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-09 21:09:10,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:10,845 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] [2018-04-09 21:09:10,845 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1445383902, 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 21:09:10,851 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:10,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:10,888 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 21:09:10,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:10,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 21:09:10,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:09:10,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-09 21:09:10,934 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 21:09:10,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 15 treesize of output 3 [2018-04-09 21:09:10,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,943 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 21:09:10,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:09:10,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:10,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:12 [2018-04-09 21:09:10,960 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 21:09:10,960 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:11,022 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 21:09:11,044 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:11,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-04-09 21:09:11,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:09:11,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:09:11,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:09:11,045 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 13 states. [2018-04-09 21:09:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:11,432 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-04-09 21:09:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:09:11,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-09 21:09:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:11,433 INFO L225 Difference]: With dead ends: 167 [2018-04-09 21:09:11,433 INFO L226 Difference]: Without dead ends: 129 [2018-04-09 21:09:11,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:09:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-09 21:09:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2018-04-09 21:09:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-09 21:09:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-04-09 21:09:11,441 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 29 [2018-04-09 21:09:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:11,442 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-04-09 21:09:11,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:09:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-04-09 21:09:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 21:09:11,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:11,443 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:11,443 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1061088070, 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 21:09:11,452 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:11,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:11,521 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))) is different from true [2018-04-09 21:09:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-09 21:09:11,528 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:11,548 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_7| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc0.base_7| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))))) is different from false [2018-04-09 21:09:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:11,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:11,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-09 21:09:11,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 21:09:11,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 21:09:11,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2018-04-09 21:09:11,575 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 11 states. [2018-04-09 21:09:11,583 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc0.base_7| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc0.base_7| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 21:09:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:11,728 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2018-04-09 21:09:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 21:09:11,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-09 21:09:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:11,729 INFO L225 Difference]: With dead ends: 131 [2018-04-09 21:09:11,729 INFO L226 Difference]: Without dead ends: 128 [2018-04-09 21:09:11,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=134, Unknown=3, NotChecked=78, Total=272 [2018-04-09 21:09:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-09 21:09:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-04-09 21:09:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-09 21:09:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-04-09 21:09:11,735 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 34 [2018-04-09 21:09:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:11,736 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-04-09 21:09:11,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 21:09:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-04-09 21:09:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 21:09:11,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:11,737 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] [2018-04-09 21:09:11,737 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1061088904, 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 21:09:11,745 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:11,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:11,780 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 21:09:11,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:11,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,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, 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 21:09:11,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:11,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-09 21:09:11,812 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 21:09:11,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,816 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 21:09:11,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,831 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 21:09:11,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,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, 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 21:09:11,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-04-09 21:09:11,867 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 21:09:11,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 21:09:11,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,892 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 32 treesize of output 25 [2018-04-09 21:09:11,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-04-09 21:09:11,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-04-09 21:09:11,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-09 21:09:11,969 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 21:09:11,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,981 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 21:09:11,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:11,985 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 21 treesize of output 8 [2018-04-09 21:09:11,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:11,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 21:09:11,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2018-04-09 21:09:12,020 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 21:09:12,020 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:12,077 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:09:12,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:12,081 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 21:09:12,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:1 [2018-04-09 21:09:12,085 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 21:09:12,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:12,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2018-04-09 21:09:12,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:09:12,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:09:12,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:09:12,119 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 13 states. [2018-04-09 21:09:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:12,404 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2018-04-09 21:09:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:09:12,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-04-09 21:09:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:12,405 INFO L225 Difference]: With dead ends: 137 [2018-04-09 21:09:12,405 INFO L226 Difference]: Without dead ends: 91 [2018-04-09 21:09:12,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-04-09 21:09:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-09 21:09:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-04-09 21:09:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-09 21:09:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-04-09 21:09:12,411 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 34 [2018-04-09 21:09:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:12,412 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-04-09 21:09:12,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:09:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-04-09 21:09:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-09 21:09:12,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:12,412 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] [2018-04-09 21:09:12,413 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash -651749331, 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 21:09:12,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:12,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:12,450 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:12,476 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:12,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:09:12,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:09:12,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:09:12,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:09:12,477 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 5 states. [2018-04-09 21:09:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:12,537 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-04-09 21:09:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:09:12,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-09 21:09:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:12,538 INFO L225 Difference]: With dead ends: 127 [2018-04-09 21:09:12,538 INFO L226 Difference]: Without dead ends: 124 [2018-04-09 21:09:12,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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 21:09:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-09 21:09:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2018-04-09 21:09:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-09 21:09:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-04-09 21:09:12,543 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 35 [2018-04-09 21:09:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:12,543 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-04-09 21:09:12,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:09:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-04-09 21:09:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-09 21:09:12,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:12,544 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:12,544 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash -564018963, 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 21:09:12,554 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:12,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:12,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:12,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:12,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:12,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:09:12,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:09:12,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:12,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:12,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-09 21:09:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:12,696 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:13,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:13,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-04-09 21:09:13,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 21:09:13,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 21:09:13,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-04-09 21:09:13,089 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 12 states. [2018-04-09 21:09:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:13,277 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-04-09 21:09:13,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 21:09:13,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-04-09 21:09:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:13,278 INFO L225 Difference]: With dead ends: 147 [2018-04-09 21:09:13,278 INFO L226 Difference]: Without dead ends: 144 [2018-04-09 21:09:13,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=186, Unknown=1, NotChecked=0, Total=272 [2018-04-09 21:09:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-09 21:09:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 93. [2018-04-09 21:09:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-09 21:09:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-09 21:09:13,285 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 35 [2018-04-09 21:09:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:13,285 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-09 21:09:13,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 21:09:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-09 21:09:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 21:09:13,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:13,286 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] [2018-04-09 21:09:13,287 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 842485185, 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 21:09:13,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:13,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:13,334 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-09 21:09:13,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:13,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:13,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:10 [2018-04-09 21:09:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:13,391 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:13,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-09 21:09:13,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:09:13,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:09:13,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:09:13,392 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 9 states. [2018-04-09 21:09:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:13,538 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-04-09 21:09:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:09:13,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-09 21:09:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:13,539 INFO L225 Difference]: With dead ends: 130 [2018-04-09 21:09:13,539 INFO L226 Difference]: Without dead ends: 126 [2018-04-09 21:09:13,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:09:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-09 21:09:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2018-04-09 21:09:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-09 21:09:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-04-09 21:09:13,547 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 36 [2018-04-09 21:09:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:13,548 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-04-09 21:09:13,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:09:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-04-09 21:09:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 21:09:13,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:13,549 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:13,549 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1740028819, 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 21:09:13,555 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:13,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:13,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:09:13,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:09:13,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:13,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:13,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:13,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-09 21:09:13,618 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 21:09:13,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:09:13,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:13,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:13,622 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 21:09:13,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-09 21:09:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:13,638 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:13,702 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:13,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-04-09 21:09:13,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 21:09:13,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 21:09:13,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:09:13,703 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 14 states. [2018-04-09 21:09:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:13,925 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-04-09 21:09:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:09:13,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-04-09 21:09:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:13,926 INFO L225 Difference]: With dead ends: 182 [2018-04-09 21:09:13,926 INFO L226 Difference]: Without dead ends: 181 [2018-04-09 21:09:13,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-04-09 21:09:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-09 21:09:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 95. [2018-04-09 21:09:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-09 21:09:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-04-09 21:09:13,934 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 43 [2018-04-09 21:09:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:13,935 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-04-09 21:09:13,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 21:09:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-04-09 21:09:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-09 21:09:13,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:13,936 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:13,936 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1893681575, 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 21:09:13,944 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:13,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:14,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:14,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:09:14,019 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 21:09:14,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:14,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,037 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 21:09:14,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-09 21:09:14,068 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 21:09:14,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:09:14,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,073 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 21:09:14,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-04-09 21:09:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:14,081 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:14,153 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:14,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-04-09 21:09:14,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 21:09:14,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 21:09:14,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:09:14,154 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 14 states. [2018-04-09 21:09:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:14,488 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-04-09 21:09:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 21:09:14,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-04-09 21:09:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:14,489 INFO L225 Difference]: With dead ends: 149 [2018-04-09 21:09:14,489 INFO L226 Difference]: Without dead ends: 148 [2018-04-09 21:09:14,489 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-04-09 21:09:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-09 21:09:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2018-04-09 21:09:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-09 21:09:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-04-09 21:09:14,494 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 44 [2018-04-09 21:09:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:14,494 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-04-09 21:09:14,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 21:09:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-04-09 21:09:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:09:14,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:14,495 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:14,495 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:14,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1930685962, 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 21:09:14,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:14,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:14,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:14,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:14,570 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 11 treesize of output 4 [2018-04-09 21:09:14,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-04-09 21:09:14,588 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 21:09:14,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:09:14,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-04-09 21:09:14,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-09 21:09:14,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 14 treesize of output 13 [2018-04-09 21:09:14,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,620 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 21:09:14,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-09 21:09:14,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-09 21:09:14,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:14,642 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 34 treesize of output 45 [2018-04-09 21:09:14,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,653 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 21:09:14,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-09 21:09:14,698 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 44 treesize of output 30 [2018-04-09 21:09:14,700 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 23 treesize of output 9 [2018-04-09 21:09:14,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:09:14,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,710 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 21:09:14,711 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2018-04-09 21:09:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:14,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:14,780 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 34 treesize of output 28 [2018-04-09 21:09:14,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:14,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,800 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 21:09:14,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-04-09 21:09:14,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,803 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 21:09:14,805 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 21:09:14,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2018-04-09 21:09:14,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:14,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:14,874 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 13 treesize of output 11 [2018-04-09 21:09:14,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:14,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-04-09 21:09:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:14,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:14,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-04-09 21:09:14,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:09:14,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:09:14,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:09:14,907 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 21 states. [2018-04-09 21:09:16,321 WARN L148 SmtUtils]: Spent 751ms on a formula simplification that was a NOOP. DAG size: 22 [2018-04-09 21:09:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:16,475 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-04-09 21:09:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 21:09:16,475 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-04-09 21:09:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:16,476 INFO L225 Difference]: With dead ends: 199 [2018-04-09 21:09:16,476 INFO L226 Difference]: Without dead ends: 196 [2018-04-09 21:09:16,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=409, Invalid=1661, Unknown=0, NotChecked=0, Total=2070 [2018-04-09 21:09:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-09 21:09:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 147. [2018-04-09 21:09:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-09 21:09:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-04-09 21:09:16,486 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 47 [2018-04-09 21:09:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:16,486 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-04-09 21:09:16,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:09:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-04-09 21:09:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:09:16,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:16,487 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:16,487 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1930686796, 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 21:09:16,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:16,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:16,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:16,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:16,519 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 21:09:16,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 21:09:16,533 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 21:09:16,534 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 21:09:16,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-04-09 21:09:16,552 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 21:09:16,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 14 treesize of output 13 [2018-04-09 21:09:16,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,563 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 21:09:16,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-09 21:09:16,580 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 44 treesize of output 38 [2018-04-09 21:09:16,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:16,583 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 35 treesize of output 46 [2018-04-09 21:09:16,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,595 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 21:09:16,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-09 21:09:16,650 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 45 treesize of output 31 [2018-04-09 21:09:16,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-04-09 21:09:16,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:09:16,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,662 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 21:09:16,663 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:10 [2018-04-09 21:09:16,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:16,685 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 12 treesize of output 21 [2018-04-09 21:09:16,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,690 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 21:09:16,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-09 21:09:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:16,711 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:16,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-04-09 21:09:16,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,783 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 26 treesize of output 21 [2018-04-09 21:09:16,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:16,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:09:16,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2018-04-09 21:09:17,359 WARN L148 SmtUtils]: Spent 549ms on a formula simplification that was a NOOP. DAG size: 24 [2018-04-09 21:09:17,362 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 32 [2018-04-09 21:09:17,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:17,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:17,385 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 21:09:17,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-04-09 21:09:17,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:17,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:17,389 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 21:09:17,395 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 21:09:17,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:8 [2018-04-09 21:09:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:17,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:17,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-04-09 21:09:17,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-09 21:09:17,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-09 21:09:17,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-04-09 21:09:17,469 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 22 states. [2018-04-09 21:09:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:18,477 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-04-09 21:09:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 21:09:18,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-04-09 21:09:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:18,478 INFO L225 Difference]: With dead ends: 207 [2018-04-09 21:09:18,478 INFO L226 Difference]: Without dead ends: 205 [2018-04-09 21:09:18,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-04-09 21:09:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-09 21:09:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2018-04-09 21:09:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-09 21:09:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2018-04-09 21:09:18,486 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 47 [2018-04-09 21:09:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:18,487 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2018-04-09 21:09:18,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-09 21:09:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2018-04-09 21:09:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:09:18,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:18,487 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:18,487 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1930686797, 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 21:09:18,493 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:18,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:18,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:18,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:18,531 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 21:09:18,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 21:09:18,558 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 21:09:18,560 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 21:09:18,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,571 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 21:09:18,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:09:18,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-09 21:09:18,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-09 21:09:18,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:09:18,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-09 21:09:18,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:09:18,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2018-04-09 21:09:18,647 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 34 treesize of output 37 [2018-04-09 21:09:18,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:18,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:18,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, 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 35 [2018-04-09 21:09:18,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,673 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 53 treesize of output 45 [2018-04-09 21:09:18,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:18,676 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 42 treesize of output 55 [2018-04-09 21:09:18,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-04-09 21:09:18,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-04-09 21:09:18,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:09:18,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-04-09 21:09:18,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,770 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 25 [2018-04-09 21:09:18,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:18,773 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 16 treesize of output 8 [2018-04-09 21:09:18,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:18,781 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 21:09:18,781 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2018-04-09 21:09:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:18,874 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:19,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-09 21:09:19,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:19,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2018-04-09 21:09:19,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 21:09:19,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:09:19,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-09 21:09:19,634 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:09:19,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:19,663 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 21:09:19,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:19,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:19,686 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 21:09:19,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:09:19,688 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:19,689 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:19,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:09:19,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:09:19,701 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:132, output treesize:35 [2018-04-09 21:09:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:19,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:19,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-04-09 21:09:19,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 21:09:19,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 21:09:19,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-09 21:09:19,882 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 25 states. [2018-04-09 21:09:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:21,631 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2018-04-09 21:09:21,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-09 21:09:21,631 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-04-09 21:09:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:21,632 INFO L225 Difference]: With dead ends: 256 [2018-04-09 21:09:21,632 INFO L226 Difference]: Without dead ends: 254 [2018-04-09 21:09:21,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1039, Invalid=2867, Unknown=0, NotChecked=0, Total=3906 [2018-04-09 21:09:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-09 21:09:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 192. [2018-04-09 21:09:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-09 21:09:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2018-04-09 21:09:21,643 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 47 [2018-04-09 21:09:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:21,643 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2018-04-09 21:09:21,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 21:09:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2018-04-09 21:09:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-09 21:09:21,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:21,644 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] [2018-04-09 21:09:21,644 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash -142927862, 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 21:09:21,652 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:21,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:21,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:21,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:21,686 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 21:09:21,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 21:09:21,696 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 21:09:21,698 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 21:09:21,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,702 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 21:09:21,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-09 21:09:21,736 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 21:09:21,737 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 21:09:21,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-04-09 21:09:21,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:21,753 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 12 treesize of output 21 [2018-04-09 21:09:21,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,758 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 21:09:21,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-09 21:09:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:21,772 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:21,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:09:21,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:21,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-04-09 21:09:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:21,878 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:09:21,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2018-04-09 21:09:21,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 21:09:21,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 21:09:21,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-04-09 21:09:21,879 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand 20 states. [2018-04-09 21:09:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:22,317 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2018-04-09 21:09:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 21:09:22,318 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-04-09 21:09:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:22,318 INFO L225 Difference]: With dead ends: 211 [2018-04-09 21:09:22,318 INFO L226 Difference]: Without dead ends: 210 [2018-04-09 21:09:22,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-04-09 21:09:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-09 21:09:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2018-04-09 21:09:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-09 21:09:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-04-09 21:09:22,327 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 48 [2018-04-09 21:09:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:22,327 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-04-09 21:09:22,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 21:09:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-04-09 21:09:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:09:22,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:22,328 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:22,328 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1111647649, 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 21:09:22,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:22,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:22,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:22,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:09:22,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:22,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:22,380 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 21:09:22,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,387 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 12 treesize of output 15 [2018-04-09 21:09:22,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-09 21:09:22,415 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 21:09:22,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:22,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,432 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 21:09:22,433 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 21:09:22,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:35 [2018-04-09 21:09:22,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-09 21:09:22,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:09:22,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,480 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 48 treesize of output 44 [2018-04-09 21:09:22,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:09:22,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-04-09 21:09:22,523 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 34 treesize of output 37 [2018-04-09 21:09:22,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:22,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:22,527 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 35 [2018-04-09 21:09:22,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,551 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 53 treesize of output 45 [2018-04-09 21:09:22,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:22,554 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 42 treesize of output 55 [2018-04-09 21:09:22,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-09 21:09:22,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-04-09 21:09:22,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:09:22,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,628 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 33 treesize of output 17 [2018-04-09 21:09:22,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,641 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 25 [2018-04-09 21:09:22,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:22,644 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 16 treesize of output 8 [2018-04-09 21:09:22,644 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,647 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,652 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 21:09:22,652 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-04-09 21:09:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:22,728 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:22,852 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 21:09:22,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 9 treesize of output 8 [2018-04-09 21:09:22,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,874 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 21:09:22,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-09 21:09:22,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,880 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 21:09:22,887 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 71 treesize of output 48 [2018-04-09 21:09:22,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:22,923 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,939 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 21:09:22,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:09:22,940 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,943 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,944 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 27 treesize of output 21 [2018-04-09 21:09:22,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-04-09 21:09:22,946 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,948 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:22,958 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:09:22,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:09:22,972 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:105, output treesize:38 [2018-04-09 21:09:23,068 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:23,069 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:23,069 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 13 treesize of output 3 [2018-04-09 21:09:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:23,073 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 21:09:23,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-04-09 21:09:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:23,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:23,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-04-09 21:09:23,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-09 21:09:23,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-09 21:09:23,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-04-09 21:09:23,156 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 29 states. [2018-04-09 21:09:24,138 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 110 DAG size of output 83 [2018-04-09 21:09:49,548 WARN L151 SmtUtils]: Spent 24120ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-04-09 21:09:49,890 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 105 DAG size of output 78 [2018-04-09 21:09:50,525 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-04-09 21:09:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:51,087 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2018-04-09 21:09:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-09 21:09:51,088 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-04-09 21:09:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:51,089 INFO L225 Difference]: With dead ends: 325 [2018-04-09 21:09:51,089 INFO L226 Difference]: Without dead ends: 324 [2018-04-09 21:09:51,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=1788, Invalid=5018, Unknown=0, NotChecked=0, Total=6806 [2018-04-09 21:09:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-04-09 21:09:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 195. [2018-04-09 21:09:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-09 21:09:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-04-09 21:09:51,098 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 50 [2018-04-09 21:09:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:51,098 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-04-09 21:09:51,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-09 21:09:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-04-09 21:09:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-09 21:09:51,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:51,099 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:51,099 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1980996322, 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 21:09:51,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:51,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:51,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,133 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 21:09:51,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 21:09:51,147 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 21:09:51,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, 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 21:09:51,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-04-09 21:09:51,165 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 21:09:51,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:51,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,175 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 21:09:51,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-09 21:09:51,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-09 21:09:51,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,201 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 21:09:51,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:47 [2018-04-09 21:09:51,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-04-09 21:09:51,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,240 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 41 treesize of output 54 [2018-04-09 21:09:51,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,261 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 21:09:51,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:59 [2018-04-09 21:09:51,401 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 66 treesize of output 46 [2018-04-09 21:09:51,408 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 39 treesize of output 19 [2018-04-09 21:09:51,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:09:51,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,427 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 21:09:51,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:19 [2018-04-09 21:09:51,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-09 21:09:51,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,452 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 21:09:51,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-04-09 21:09:51,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:51,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-04-09 21:09:51,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:09:51,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 21:09:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:51,532 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:51,711 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:51,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:51,713 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-04-09 21:09:51,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:51,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:51,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-09 21:09:51,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:51,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:51,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:51,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 [2018-04-09 21:09:51,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 21:09:51,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:09:51,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-09 21:09:51,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:60 [2018-04-09 21:09:53,170 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:09:53,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-09 21:09:53,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:09:53,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:53,186 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 32 treesize of output 35 [2018-04-09 21:09:53,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2018-04-09 21:09:53,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,200 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 21:09:53,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-04-09 21:09:53,215 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,216 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:53,222 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:100, output treesize:8 [2018-04-09 21:09:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:53,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:53,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-04-09 21:09:53,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-09 21:09:53,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-09 21:09:53,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-04-09 21:09:53,313 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 31 states. [2018-04-09 21:09:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:09:54,911 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-04-09 21:09:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 21:09:54,951 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-04-09 21:09:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:09:54,952 INFO L225 Difference]: With dead ends: 208 [2018-04-09 21:09:54,952 INFO L226 Difference]: Without dead ends: 206 [2018-04-09 21:09:54,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=698, Invalid=2842, Unknown=0, NotChecked=0, Total=3540 [2018-04-09 21:09:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-09 21:09:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2018-04-09 21:09:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-09 21:09:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-04-09 21:09:54,964 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 53 [2018-04-09 21:09:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:09:54,964 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-04-09 21:09:54,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-09 21:09:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-04-09 21:09:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:09:54,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:09:54,966 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:09:54,966 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:09:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 379833185, 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 21:09:54,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:09:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:09:54,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:09:55,017 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 21:09:55,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:09:55,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 21:09:55,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:09:55,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-09 21:09:55,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:09:55,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-04-09 21:09:55,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-09 21:09:55,124 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 21:09:55,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-09 21:09:55,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:09:55,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-04-09 21:09:55,183 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 73 treesize of output 63 [2018-04-09 21:09:55,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,186 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 22 treesize of output 39 [2018-04-09 21:09:55,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,215 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 38 treesize of output 33 [2018-04-09 21:09:55,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,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, 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 35 [2018-04-09 21:09:55,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:67 [2018-04-09 21:09:55,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-04-09 21:09:55,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,266 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 68 treesize of output 84 [2018-04-09 21:09:55,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-04-09 21:09:55,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 35 [2018-04-09 21:09:55,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-04-09 21:09:55,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,536 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2018-04-09 21:09:55,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:55,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,556 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 39 [2018-04-09 21:09:55,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:09:55,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-04-09 21:09:55,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,591 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 45 treesize of output 37 [2018-04-09 21:09:55,593 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:09:55,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,594 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 18 treesize of output 13 [2018-04-09 21:09:55,594 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:09:55,602 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 21:09:55,602 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:55,609 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 21:09:55,609 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:110, output treesize:12 [2018-04-09 21:09:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:55,639 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:56,504 WARN L148 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-09 21:09:57,795 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:09:57,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:09:57,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:09:57,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:961, output treesize:1 [2018-04-09 21:09:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:09:57,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:09:57,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2018-04-09 21:09:57,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-09 21:09:57,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-09 21:09:57,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-04-09 21:09:57,841 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 31 states. [2018-04-09 21:09:59,782 WARN L151 SmtUtils]: Spent 1135ms on a formula simplification. DAG size of input: 155 DAG size of output 131 [2018-04-09 21:10:00,148 WARN L151 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 106 DAG size of output 98 [2018-04-09 21:10:00,646 WARN L151 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 124 DAG size of output 104 [2018-04-09 21:10:02,413 WARN L151 SmtUtils]: Spent 1145ms on a formula simplification. DAG size of input: 161 DAG size of output 135 [2018-04-09 21:10:03,064 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 148 DAG size of output 109 [2018-04-09 21:10:03,416 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 123 DAG size of output 84 [2018-04-09 21:10:03,713 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 127 DAG size of output 88 [2018-04-09 21:10:04,483 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 119 DAG size of output 80 [2018-04-09 21:10:04,977 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 99 DAG size of output 87 [2018-04-09 21:10:20,842 WARN L151 SmtUtils]: Spent 14085ms on a formula simplification. DAG size of input: 128 DAG size of output 122 [2018-04-09 21:10:21,145 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-04-09 21:10:22,151 WARN L151 SmtUtils]: Spent 611ms on a formula simplification. DAG size of input: 131 DAG size of output 119 [2018-04-09 21:10:23,157 WARN L151 SmtUtils]: Spent 763ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-04-09 21:10:24,242 WARN L151 SmtUtils]: Spent 740ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-04-09 21:10:24,499 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 89 DAG size of output 83 [2018-04-09 21:10:24,804 WARN L148 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 90 [2018-04-09 21:10:25,649 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-04-09 21:10:26,007 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-04-09 21:10:47,335 WARN L151 SmtUtils]: Spent 16924ms on a formula simplification. DAG size of input: 154 DAG size of output 148 [2018-04-09 21:10:52,270 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-04-09 21:10:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:10:52,712 INFO L93 Difference]: Finished difference Result 374 states and 403 transitions. [2018-04-09 21:10:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-09 21:10:52,712 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-04-09 21:10:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:10:52,713 INFO L225 Difference]: With dead ends: 374 [2018-04-09 21:10:52,713 INFO L226 Difference]: Without dead ends: 336 [2018-04-09 21:10:52,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=1217, Invalid=6265, Unknown=0, NotChecked=0, Total=7482 [2018-04-09 21:10:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-09 21:10:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 261. [2018-04-09 21:10:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-09 21:10:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 284 transitions. [2018-04-09 21:10:52,726 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 284 transitions. Word has length 54 [2018-04-09 21:10:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:10:52,726 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 284 transitions. [2018-04-09 21:10:52,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-09 21:10:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 284 transitions. [2018-04-09 21:10:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:10:52,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:10:52,727 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:10:52,727 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:10:52,727 INFO L82 PathProgramCache]: Analyzing trace with hash -496997936, 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 21:10:52,734 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:10:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:10:52,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:10:52,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:52,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:52,805 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 21:10:52,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 21:10:52,828 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 21:10:52,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:10:52,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-04-09 21:10:52,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-09 21:10:52,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:10:52,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,956 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 21:10:52,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-09 21:10:52,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-09 21:10:52,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:52,982 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 21:10:52,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:52,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,010 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 21:10:53,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-04-09 21:10:53,031 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 21:10:53,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 11 treesize of output 3 [2018-04-09 21:10:53,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,039 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 21:10:53,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-04-09 21:10:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:10:53,062 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:10:53,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-09 21:10:53,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:10:53,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,126 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 21:10:53,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 21:10:53,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,132 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 21:10:53,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 21:10:53,134 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,135 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,144 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 21:10:53,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:10:53,158 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:38, output treesize:43 [2018-04-09 21:10:53,293 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:10:53,293 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:10:53,294 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 21 treesize of output 12 [2018-04-09 21:10:53,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,310 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:10:53,311 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:10:53,311 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 16 treesize of output 7 [2018-04-09 21:10:53,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:53,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:10:53,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:13 [2018-04-09 21:10:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:10:53,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:10:53,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-04-09 21:10:53,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 21:10:53,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 21:10:53,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-04-09 21:10:53,350 INFO L87 Difference]: Start difference. First operand 261 states and 284 transitions. Second operand 20 states. [2018-04-09 21:10:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:10:54,128 INFO L93 Difference]: Finished difference Result 297 states and 321 transitions. [2018-04-09 21:10:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-09 21:10:54,128 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-09 21:10:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:10:54,131 INFO L225 Difference]: With dead ends: 297 [2018-04-09 21:10:54,132 INFO L226 Difference]: Without dead ends: 296 [2018-04-09 21:10:54,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=1163, Unknown=0, NotChecked=0, Total=1640 [2018-04-09 21:10:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-09 21:10:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 232. [2018-04-09 21:10:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-09 21:10:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2018-04-09 21:10:54,145 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 54 [2018-04-09 21:10:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:10:54,145 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2018-04-09 21:10:54,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 21:10:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2018-04-09 21:10:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 21:10:54,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:10:54,146 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:10:54,146 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:10:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1988485223, now seen corresponding path program 2 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 21:10:54,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:10:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:10:54,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:10:54,218 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 21:10:54,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:10:54,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-04-09 21:10:54,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:54,249 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 56 treesize of output 60 [2018-04-09 21:10:54,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:10:54,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,264 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 21:10:54,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-09 21:10:54,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:54,295 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 61 treesize of output 59 [2018-04-09 21:10:54,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:54,298 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 56 treesize of output 71 [2018-04-09 21:10:54,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,315 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 21:10:54,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-04-09 21:10:54,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:54,390 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 52 [2018-04-09 21:10:54,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:10:54,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:54,401 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 39 treesize of output 27 [2018-04-09 21:10:54,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,410 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 21:10:54,410 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:23 [2018-04-09 21:10:54,499 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_subst_4 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~0.base 1))) (and (= (select |c_old(#valid)| main_~y~0.base) 0) (= (store (store .cse0 v_subst_4 0) main_~y~0.base 0) |c_#valid|) (= (select .cse0 v_subst_4) 0)))) is different from true [2018-04-09 21:10:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-04-09 21:10:54,512 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:10:54,650 WARN L1011 $PredicateComparison]: unable to prove that (forall ((main_~list~0.offset Int)) (= |c_old(#valid)| (store (store |c_#valid| c_main_~y~0.base 0) (select (select (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) (+ main_~list~0.offset 4) c_main_~y~0.base)) c_main_~y~0.base) c_main_~y~0.offset) 0))) is different from false [2018-04-09 21:10:54,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 33 [2018-04-09 21:10:54,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:10:54,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,678 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 21:10:54,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2018-04-09 21:10:54,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:54,682 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 21:10:54,685 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 21:10:54,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14 [2018-04-09 21:10:54,728 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc2.base_16|))) (= (store (store |c_#valid| |v_main_#t~malloc2.base_16| 0) c_main_~list~0.base 0) |c_old(#valid)|))) is different from false [2018-04-09 21:10:54,731 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc2.base_16|))) (= (store (store |c_#valid| |v_main_#t~malloc2.base_16| 0) c_main_~y~0.base 0) |c_old(#valid)|))) is different from false [2018-04-09 21:10:54,791 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int) (|v_main_#t~malloc0.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc0.base_12|) 0)) (= (store (store .cse0 |v_main_#t~malloc2.base_16| 0) |v_main_#t~malloc0.base_12| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc2.base_16|)))))) is different from false [2018-04-09 21:10:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-09 21:10:54,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:10:54,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-09 21:10:54,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-09 21:10:54,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-09 21:10:54,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=665, Unknown=18, NotChecked=280, Total=1056 [2018-04-09 21:10:54,838 INFO L87 Difference]: Start difference. First operand 232 states and 253 transitions. Second operand 33 states. [2018-04-09 21:10:54,864 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc2.base_16| Int) (|v_main_#t~malloc0.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc0.base_12|) 0)) (= (store (store .cse0 |v_main_#t~malloc2.base_16| 0) |v_main_#t~malloc0.base_12| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc2.base_16|))))))) is different from false [2018-04-09 21:10:55,044 WARN L1011 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_old(#valid)| c_main_~list~0.base 1))) (and (= c_main_~list~0.base (select (select |c_#memory_$Pointer$.base| c_main_~y~0.base) c_main_~y~0.offset)) (forall ((main_~list~0.offset Int)) (= |c_old(#valid)| (store (store |c_#valid| c_main_~y~0.base 0) (select (select (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) (+ main_~list~0.offset 4) c_main_~y~0.base)) c_main_~y~0.base) c_main_~y~0.offset) 0))) (= c_main_~y~0.offset 0) (= (select .cse0 |c_main_#t~malloc2.base|) 0) (= |c_#valid| (store .cse0 c_main_~y~0.base 1)) (= 0 |c_main_#t~malloc2.offset|) (= |c_#valid| (store .cse0 |c_main_#t~malloc2.base| 1)) (= (select .cse0 c_main_~y~0.base) 0) (= (select |c_old(#valid)| c_main_~list~0.base) 0))) is different from false [2018-04-09 21:10:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:10:55,836 INFO L93 Difference]: Finished difference Result 277 states and 299 transitions. [2018-04-09 21:10:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-09 21:10:55,837 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-04-09 21:10:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:10:55,838 INFO L225 Difference]: With dead ends: 277 [2018-04-09 21:10:55,838 INFO L226 Difference]: Without dead ends: 274 [2018-04-09 21:10:55,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1356, Unknown=27, NotChecked=574, Total=2162 [2018-04-09 21:10:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-09 21:10:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2018-04-09 21:10:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-09 21:10:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2018-04-09 21:10:55,856 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 59 [2018-04-09 21:10:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:10:55,857 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2018-04-09 21:10:55,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-09 21:10:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2018-04-09 21:10:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 21:10:55,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:10:55,858 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:10:55,858 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:10:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1988486057, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:10:55,865 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:10:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:10:55,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:10:55,915 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 21:10:55,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:10:55,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:10:55,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:10:55,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-09 21:10:55,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:10:55,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:55,945 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 21:10:55,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:10:55,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:55,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:10:55,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:55,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-09 21:10:55,987 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 32 treesize of output 25 [2018-04-09 21:10:55,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:55,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:55,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:55,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:55,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 60 [2018-04-09 21:10:55,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,013 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 21:10:56,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,018 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 21:10:56,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-04-09 21:10:56,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,069 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 21:10:56,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-04-09 21:10:56,121 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 21:10:56,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:10:56,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,152 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 21:10:56,154 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 21:10:56,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:67 [2018-04-09 21:10:56,205 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 117 treesize of output 95 [2018-04-09 21:10:56,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,211 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 32 treesize of output 50 [2018-04-09 21:10:56,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:10:56,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-04-09 21:10:56,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,245 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 33 treesize of output 49 [2018-04-09 21:10:56,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-04-09 21:10:56,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-09 21:10:56,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,297 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 35 [2018-04-09 21:10:56,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2018-04-09 21:10:56,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,331 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 86 treesize of output 106 [2018-04-09 21:10:56,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:109 [2018-04-09 21:10:56,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 87 [2018-04-09 21:10:56,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,489 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 77 [2018-04-09 21:10:56,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-09 21:10:56,516 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 52 treesize of output 37 [2018-04-09 21:10:56,517 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 21:10:56,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:10:56,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-04-09 21:10:56,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,539 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 23 treesize of output 13 [2018-04-09 21:10:56,539 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:10:56,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:10:56,548 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:10:56,556 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 21:10:56,556 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:7 [2018-04-09 21:10:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:10:56,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:11:33,052 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:11:33,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:11:33,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:11:33,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:951, output treesize:1 [2018-04-09 21:11:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:11:33,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:11:33,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2018-04-09 21:11:33,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-09 21:11:33,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-09 21:11:33,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2018-04-09 21:11:33,100 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 28 states. [2018-04-09 21:12:01,117 WARN L151 SmtUtils]: Spent 20165ms on a formula simplification. DAG size of input: 192 DAG size of output 184 [2018-04-09 21:13:13,118 WARN L151 SmtUtils]: Spent 48533ms on a formula simplification. DAG size of input: 196 DAG size of output 186 [2018-04-09 21:13:23,931 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 89 DAG size of output 83 [2018-04-09 21:13:24,273 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 95 DAG size of output 89 [2018-04-09 21:13:24,455 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 124 DAG size of output 118 [2018-04-09 21:13:26,740 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 110 DAG size of output 78 [2018-04-09 21:13:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:13:28,343 INFO L93 Difference]: Finished difference Result 339 states and 365 transitions. [2018-04-09 21:13:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-09 21:13:28,343 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 59 [2018-04-09 21:13:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:13:28,344 INFO L225 Difference]: With dead ends: 339 [2018-04-09 21:13:28,344 INFO L226 Difference]: Without dead ends: 281 [2018-04-09 21:13:28,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 125.0s TimeCoverageRelationStatistics Valid=304, Invalid=2043, Unknown=5, NotChecked=0, Total=2352 [2018-04-09 21:13:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-09 21:13:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 223. [2018-04-09 21:13:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-09 21:13:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 243 transitions. [2018-04-09 21:13:28,357 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 243 transitions. Word has length 59 [2018-04-09 21:13:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:13:28,357 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 243 transitions. [2018-04-09 21:13:28,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-09 21:13:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 243 transitions. [2018-04-09 21:13:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 21:13:28,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:13:28,358 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:13:28,358 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:13:28,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1967093306, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:13:28,374 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:13:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:13:28,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:13:28,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:28,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:28,419 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 11 treesize of output 4 [2018-04-09 21:13:28,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-04-09 21:13:28,438 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 21:13:28,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:13:28,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-04-09 21:13:28,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-09 21:13:28,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:13:28,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,476 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 21:13:28,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-09 21:13:28,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-09 21:13:28,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:28,503 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 34 treesize of output 45 [2018-04-09 21:13:28,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,516 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 21:13:28,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-09 21:13:28,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-04-09 21:13:28,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:13:28,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,572 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 23 treesize of output 9 [2018-04-09 21:13:28,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,577 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 21:13:28,577 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2018-04-09 21:13:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:13:28,600 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:13:28,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-09 21:13:28,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:13:28,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,990 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 21:13:28,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 13 treesize of output 4 [2018-04-09 21:13:28,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:28,993 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 21:13:28,996 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 21:13:28,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2018-04-09 21:13:29,640 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:13:29,640 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:13:29,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 21:13:29,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:29,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:29,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-04-09 21:13:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:13:29,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:13:29,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-04-09 21:13:29,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:13:29,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:13:29,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:13:29,687 INFO L87 Difference]: Start difference. First operand 223 states and 243 transitions. Second operand 21 states. [2018-04-09 21:13:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:13:31,046 INFO L93 Difference]: Finished difference Result 301 states and 323 transitions. [2018-04-09 21:13:31,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-09 21:13:31,046 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-09 21:13:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:13:31,047 INFO L225 Difference]: With dead ends: 301 [2018-04-09 21:13:31,048 INFO L226 Difference]: Without dead ends: 298 [2018-04-09 21:13:31,048 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=780, Invalid=1872, Unknown=0, NotChecked=0, Total=2652 [2018-04-09 21:13:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-09 21:13:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 195. [2018-04-09 21:13:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-09 21:13:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2018-04-09 21:13:31,060 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 60 [2018-04-09 21:13:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:13:31,061 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2018-04-09 21:13:31,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:13:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2018-04-09 21:13:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 21:13:31,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:13:31,061 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:13:31,061 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:13:31,062 INFO L82 PathProgramCache]: Analyzing trace with hash -504860744, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:13:31,067 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:13:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:13:31,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:13:31,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:31,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:31,106 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 21:13:31,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 21:13:31,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:13:31,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:13:31,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,130 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 21:13:31,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-09 21:13:31,162 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 21:13:31,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:13:31,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:4 [2018-04-09 21:13:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:13:31,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:13:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:13:31,282 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:13:31,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 16 [2018-04-09 21:13:31,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 21:13:31,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 21:13:31,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:13:31,283 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand 16 states. [2018-04-09 21:13:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:13:31,642 INFO L93 Difference]: Finished difference Result 277 states and 297 transitions. [2018-04-09 21:13:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 21:13:31,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-04-09 21:13:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:13:31,643 INFO L225 Difference]: With dead ends: 277 [2018-04-09 21:13:31,643 INFO L226 Difference]: Without dead ends: 213 [2018-04-09 21:13:31,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2018-04-09 21:13:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-09 21:13:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 195. [2018-04-09 21:13:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-09 21:13:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 209 transitions. [2018-04-09 21:13:31,660 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 209 transitions. Word has length 60 [2018-04-09 21:13:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:13:31,660 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 209 transitions. [2018-04-09 21:13:31,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 21:13:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 209 transitions. [2018-04-09 21:13:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-09 21:13:31,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:13:31,661 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:13:31,661 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:13:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1933235911, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:13:31,667 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:13:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:13:31,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:13:31,750 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 21:13:31,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:13:31,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:33 [2018-04-09 21:13:31,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:31,788 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 56 treesize of output 60 [2018-04-09 21:13:31,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:13:31,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,808 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 21:13:31,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-09 21:13:31,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:31,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2018-04-09 21:13:31,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:31,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:31,864 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 72 treesize of output 97 [2018-04-09 21:13:31,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:31,888 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 21:13:31,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:81 [2018-04-09 21:13:32,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:32,065 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 88 treesize of output 72 [2018-04-09 21:13:32,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:32,069 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 65 treesize of output 45 [2018-04-09 21:13:32,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:13:32,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,092 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 21:13:32,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:88, output treesize:37 [2018-04-09 21:13:32,287 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (|main_#t~mem8.base| Int) (v_subst_6 Int)) (let ((.cse1 (store |c_old(#valid)| main_~y~0.base 1))) (let ((.cse0 (store .cse1 v_subst_6 1))) (and (= (store (store (store .cse0 |main_#t~mem8.base| 0) v_subst_6 0) main_~y~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~y~0.base) 0) (= (select .cse1 v_subst_6) 0) (= 0 (select .cse0 |main_#t~mem8.base|)))))) is different from true [2018-04-09 21:13:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-04-09 21:13:32,308 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:13:32,744 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 95 treesize of output 72 [2018-04-09 21:13:32,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 9 treesize of output 8 [2018-04-09 21:13:32,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,755 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:13:32,758 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 71 treesize of output 65 [2018-04-09 21:13:32,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, 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 21:13:32,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,769 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:13:32,770 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 61 treesize of output 56 [2018-04-09 21:13:32,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 25 [2018-04-09 21:13:32,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:13:32,794 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,798 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:32,805 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 21:13:32,812 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 21:13:32,813 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:114, output treesize:40 [2018-04-09 21:13:33,109 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_20| Int) (|v_main_#t~malloc5.base_11| Int) (|v_main_#t~malloc0.base_13| Int)) (let ((.cse2 (store |c_#valid| |v_main_#t~malloc0.base_13| 1))) (let ((.cse1 (store .cse2 |v_main_#t~malloc2.base_20| 1))) (let ((.cse0 (store (store .cse1 |v_main_#t~malloc5.base_11| 0) |v_main_#t~malloc2.base_20| 0))) (or (= (store .cse0 |v_main_#t~malloc0.base_13| 0) |c_old(#valid)|) (not (= 0 (select .cse1 |v_main_#t~malloc5.base_11|))) (not (= (select .cse2 |v_main_#t~malloc2.base_20|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_13|))) (not (= 1 (select .cse0 |v_main_#t~malloc0.base_13|)))))))) is different from false [2018-04-09 21:13:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:13:33,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:13:33,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2018-04-09 21:13:33,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-09 21:13:33,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-09 21:13:33,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1270, Unknown=17, NotChecked=146, Total=1560 [2018-04-09 21:13:33,150 INFO L87 Difference]: Start difference. First operand 195 states and 209 transitions. Second operand 40 states. [2018-04-09 21:13:33,202 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc2.base_20| Int) (|v_main_#t~malloc5.base_11| Int) (|v_main_#t~malloc0.base_13| Int)) (let ((.cse2 (store |c_#valid| |v_main_#t~malloc0.base_13| 1))) (let ((.cse1 (store .cse2 |v_main_#t~malloc2.base_20| 1))) (let ((.cse0 (store (store .cse1 |v_main_#t~malloc5.base_11| 0) |v_main_#t~malloc2.base_20| 0))) (or (= (store .cse0 |v_main_#t~malloc0.base_13| 0) |c_old(#valid)|) (not (= 0 (select .cse1 |v_main_#t~malloc5.base_11|))) (not (= (select .cse2 |v_main_#t~malloc2.base_20|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_13|))) (not (= 1 (select .cse0 |v_main_#t~malloc0.base_13|)))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 21:13:34,052 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 99 DAG size of output 86 [2018-04-09 21:13:35,345 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-04-09 21:13:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:13:36,269 INFO L93 Difference]: Finished difference Result 264 states and 280 transitions. [2018-04-09 21:13:36,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 21:13:36,299 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 65 [2018-04-09 21:13:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:13:36,300 INFO L225 Difference]: With dead ends: 264 [2018-04-09 21:13:36,300 INFO L226 Difference]: Without dead ends: 261 [2018-04-09 21:13:36,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=430, Invalid=3596, Unknown=18, NotChecked=378, Total=4422 [2018-04-09 21:13:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-09 21:13:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 234. [2018-04-09 21:13:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-09 21:13:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 249 transitions. [2018-04-09 21:13:36,322 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 249 transitions. Word has length 65 [2018-04-09 21:13:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:13:36,322 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 249 transitions. [2018-04-09 21:13:36,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-09 21:13:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 249 transitions. [2018-04-09 21:13:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-09 21:13:36,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:13:36,328 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:13:36,328 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:13:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1933235077, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:13:36,339 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:13:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:13:36,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:13:36,384 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 21:13:36,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:13:36,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,395 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 21:13:36,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:13:36,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-09 21:13:36,414 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 21:13:36,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:13:36,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:13:36,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:13:36,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2018-04-09 21:13:36,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-09 21:13:36,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-04-09 21:13:36,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:13:36,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,510 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 21:13:36,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-04-09 21:13:36,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,563 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 21:13:36,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-04-09 21:13:36,617 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 21:13:36,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:13:36,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,655 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 21:13:36,657 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 21:13:36,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:67 [2018-04-09 21:13:36,708 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 117 treesize of output 95 [2018-04-09 21:13:36,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,715 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 32 treesize of output 50 [2018-04-09 21:13:36,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:13:36,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-04-09 21:13:36,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-04-09 21:13:36,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,775 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-04-09 21:13:36,831 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 92 treesize of output 72 [2018-04-09 21:13:36,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,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 73 treesize of output 94 [2018-04-09 21:13:36,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,870 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 54 treesize of output 57 [2018-04-09 21:13:36,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:36,874 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 21:13:36,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:36,897 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 21:13:36,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:89 [2018-04-09 21:13:37,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:13:37,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,017 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 21:13:37,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:105 [2018-04-09 21:13:37,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:37,047 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 8 [2018-04-09 21:13:37,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 78 [2018-04-09 21:13:37,064 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 54 treesize of output 47 [2018-04-09 21:13:37,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2018-04-09 21:13:37,078 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 21:13:37,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:13:37,097 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 37 [2018-04-09 21:13:37,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:13:37,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-04-09 21:13:37,100 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21:13:37,109 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,114 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:130, output treesize:7 [2018-04-09 21:13:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:13:37,168 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:13:37,217 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 17 treesize of output 11 [2018-04-09 21:13:37,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-09 21:13:37,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:13:37,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:13:37,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:27 Received shutdown request... [2018-04-09 21:13:39,051 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 21:13:39,052 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 21:13:39,056 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 21:13:39,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 09:13:39 BoogieIcfgContainer [2018-04-09 21:13:39,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 21:13:39,057 INFO L168 Benchmark]: Toolchain (without parser) took 271822.02 ms. Allocated memory was 304.6 MB in the beginning and 588.8 MB in the end (delta: 284.2 MB). Free memory was 242.0 MB in the beginning and 470.9 MB in the end (delta: -228.9 MB). Peak memory consumption was 55.2 MB. Max. memory is 5.3 GB. [2018-04-09 21:13:39,058 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 304.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 21:13:39,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.98 ms. Allocated memory is still 304.6 MB. Free memory was 242.0 MB in the beginning and 218.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:13:39,058 INFO L168 Benchmark]: Boogie Preprocessor took 59.95 ms. Allocated memory is still 304.6 MB. Free memory was 218.0 MB in the beginning and 215.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:13:39,058 INFO L168 Benchmark]: RCFGBuilder took 537.18 ms. Allocated memory was 304.6 MB in the beginning and 465.0 MB in the end (delta: 160.4 MB). Free memory was 215.0 MB in the beginning and 399.3 MB in the end (delta: -184.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:13:39,059 INFO L168 Benchmark]: TraceAbstraction took 270885.95 ms. Allocated memory was 465.0 MB in the beginning and 588.8 MB in the end (delta: 123.7 MB). Free memory was 399.3 MB in the beginning and 470.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 52.2 MB. Max. memory is 5.3 GB. [2018-04-09 21:13:39,060 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.29 ms. Allocated memory is still 304.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 333.98 ms. Allocated memory is still 304.6 MB. Free memory was 242.0 MB in the beginning and 218.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 59.95 ms. Allocated memory is still 304.6 MB. Free memory was 218.0 MB in the beginning and 215.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 537.18 ms. Allocated memory was 304.6 MB in the beginning and 465.0 MB in the end (delta: 160.4 MB). Free memory was 215.0 MB in the beginning and 399.3 MB in the end (delta: -184.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 270885.95 ms. Allocated memory was 465.0 MB in the beginning and 588.8 MB in the end (delta: 123.7 MB). Free memory was 399.3 MB in the beginning and 470.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 52.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 25 error locations. TIMEOUT Result, 270.8s OverallTime, 30 OverallIterations, 3 TraceHistogramMax, 214.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1722 SDtfs, 8046 SDslu, 11527 SDs, 0 SdLazy, 10299 SolverSat, 1796 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 38.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2765 GetRequests, 1852 SyntacticMatches, 30 SemanticMatches, 883 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 9672 ImplicationChecksByTransitivity, 221.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 1454 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 51.8s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2242 ConstructedInterpolants, 328 QuantifiedInterpolants, 2134091 SizeOfPredicates, 322 NumberOfNonLiveVariables, 4107 ConjunctsInSsa, 683 ConjunctsInUnsatCore, 58 InterpolantComputations, 30 PerfectInterpolantSequences, 106/378 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_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_21-13-39-067.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_21-13-39-067.csv Completed graceful shutdown