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-4cf2d92 [2018-03-28 12:51:20,676 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-28 12:51:20,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-28 12:51:20,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-28 12:51:20,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-28 12:51:20,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-28 12:51:20,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-28 12:51:20,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-28 12:51:20,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-28 12:51:20,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-28 12:51:20,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-28 12:51:20,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-28 12:51:20,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-28 12:51:20,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-28 12:51:20,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-28 12:51:20,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-28 12:51:20,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-28 12:51:20,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-28 12:51:20,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-28 12:51:20,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-28 12:51:20,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-28 12:51:20,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-28 12:51:20,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-28 12:51:20,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-28 12:51:20,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-28 12:51:20,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-28 12:51:20,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-28 12:51:20,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-28 12:51:20,722 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-28 12:51:20,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-28 12:51:20,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-28 12:51:20,724 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-03-28 12:51:20,749 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-28 12:51:20,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-28 12:51:20,750 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-28 12:51:20,750 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-28 12:51:20,751 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-28 12:51:20,751 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-28 12:51:20,751 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-28 12:51:20,751 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-28 12:51:20,751 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-28 12:51:20,752 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-28 12:51:20,752 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-28 12:51:20,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-28 12:51:20,752 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-28 12:51:20,753 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-28 12:51:20,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-28 12:51:20,753 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-28 12:51:20,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-28 12:51:20,753 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-28 12:51:20,754 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-28 12:51:20,754 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-28 12:51:20,754 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-28 12:51:20,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-28 12:51:20,754 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-28 12:51:20,755 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-28 12:51:20,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-28 12:51:20,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 12:51:20,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-28 12:51:20,756 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-28 12:51:20,756 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-28 12:51:20,756 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-28 12:51:20,756 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-28 12:51:20,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:51:20,757 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-28 12:51:20,757 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-28 12:51:20,758 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-28 12:51:20,758 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-28 12:51:20,758 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-28 12:51:20,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-28 12:51:20,807 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-28 12:51:20,811 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-28 12:51:20,812 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-28 12:51:20,813 INFO L276 PluginConnector]: CDTParser initialized [2018-03-28 12:51:20,814 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-03-28 12:51:21,135 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0e47cb364 [2018-03-28 12:51:21,312 INFO L291 CDTParser]: IsIndexed: true [2018-03-28 12:51:21,312 INFO L292 CDTParser]: Found 1 translation units. [2018-03-28 12:51:21,313 INFO L171 CDTParser]: Scanning dll_extends_pointer_true-valid-memsafety.i [2018-03-28 12:51:21,323 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-28 12:51:21,323 INFO L215 ultiparseSymbolTable]: [2018-03-28 12:51:21,323 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-28 12:51:21,323 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll_extends_pointer_true-valid-memsafety.i [2018-03-28 12:51:21,323 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,324 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,325 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,326 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,327 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,328 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-03-28 12:51:21,329 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-03-28 12:51:21,329 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-03-28 12:51:21,329 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-03-28 12:51:21,329 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-03-28 12:51:21,329 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-03-28 12:51:21,329 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-03-28 12:51:21,329 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-03-28 12:51:21,329 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,330 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,331 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-03-28 12:51:21,332 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-03-28 12:51:21,332 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-03-28 12:51:21,332 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-03-28 12:51:21,332 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-03-28 12:51:21,332 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-03-28 12:51:21,332 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-03-28 12:51:21,332 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-03-28 12:51:21,332 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,333 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-03-28 12:51:21,334 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-03-28 12:51:21,334 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-03-28 12:51:21,334 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-03-28 12:51:21,334 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-03-28 12:51:21,334 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-03-28 12:51:21,334 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-03-28 12:51:21,334 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,335 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-03-28 12:51:21,336 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-03-28 12:51:21,353 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0e47cb364 [2018-03-28 12:51:21,357 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-28 12:51:21,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-28 12:51:21,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-28 12:51:21,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-28 12:51:21,369 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-28 12:51:21,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b97952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21, skipping insertion in model container [2018-03-28 12:51:21,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,386 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 12:51:21,419 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 12:51:21,611 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 12:51:21,656 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 12:51:21,663 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-03-28 12:51:21,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21 WrapperNode [2018-03-28 12:51:21,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-28 12:51:21,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-28 12:51:21,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-28 12:51:21,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-28 12:51:21,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (1/1) ... [2018-03-28 12:51:21,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-28 12:51:21,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-28 12:51:21,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-28 12:51:21,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-28 12:51:21,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (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-03-28 12:51:21,877 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-28 12:51:21,877 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-28 12:51:21,877 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-28 12:51:21,877 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-28 12:51:21,877 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-03-28 12:51:21,877 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-28 12:51:21,877 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-28 12:51:21,878 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-28 12:51:21,878 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-28 12:51:21,878 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-28 12:51:21,878 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-28 12:51:21,878 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-28 12:51:21,878 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-28 12:51:21,878 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-28 12:51:21,879 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-28 12:51:21,879 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-28 12:51:21,879 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-28 12:51:21,879 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-28 12:51:21,879 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-28 12:51:21,879 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-28 12:51:21,879 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-28 12:51:21,880 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-28 12:51:21,880 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-28 12:51:21,880 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-28 12:51:21,880 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-28 12:51:21,880 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-28 12:51:21,880 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-28 12:51:21,880 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-28 12:51:21,881 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-28 12:51:21,881 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-28 12:51:21,881 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-28 12:51:21,881 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-28 12:51:21,881 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-28 12:51:21,881 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-28 12:51:21,882 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-28 12:51:21,882 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-28 12:51:21,882 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-28 12:51:21,882 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-28 12:51:21,882 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-28 12:51:21,882 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-28 12:51:21,882 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-28 12:51:21,883 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-28 12:51:21,884 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-28 12:51:21,884 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-28 12:51:21,884 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-28 12:51:21,884 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-28 12:51:21,884 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-28 12:51:21,884 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-28 12:51:21,884 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-28 12:51:21,885 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-28 12:51:21,886 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-28 12:51:21,886 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-28 12:51:21,886 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-28 12:51:21,886 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-28 12:51:21,886 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-28 12:51:21,886 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-03-28 12:51:21,886 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-28 12:51:21,887 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-28 12:51:21,888 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-28 12:51:21,888 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-28 12:51:21,888 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-28 12:51:21,888 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-28 12:51:21,888 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-28 12:51:21,888 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-28 12:51:21,888 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-28 12:51:21,889 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-28 12:51:21,890 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-28 12:51:21,890 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-28 12:51:21,890 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-28 12:51:21,890 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-28 12:51:21,890 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-28 12:51:21,890 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-28 12:51:21,890 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-28 12:51:21,891 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-03-28 12:51:21,892 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-03-28 12:51:21,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-28 12:51:21,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-28 12:51:21,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-28 12:51:22,284 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-28 12:51:22,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:51:22 BoogieIcfgContainer [2018-03-28 12:51:22,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-28 12:51:22,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-28 12:51:22,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-28 12:51:22,288 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-28 12:51:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:51:21" (1/3) ... [2018-03-28 12:51:22,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6179943b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:51:22, skipping insertion in model container [2018-03-28 12:51:22,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:51:21" (2/3) ... [2018-03-28 12:51:22,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6179943b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:51:22, skipping insertion in model container [2018-03-28 12:51:22,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:51:22" (3/3) ... [2018-03-28 12:51:22,290 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-03-28 12:51:22,297 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-28 12:51:22,303 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-03-28 12:51:22,348 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-28 12:51:22,348 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-28 12:51:22,349 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-28 12:51:22,349 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-28 12:51:22,349 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-28 12:51:22,349 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-28 12:51:22,349 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-28 12:51:22,349 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-28 12:51:22,349 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-28 12:51:22,350 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-28 12:51:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-03-28 12:51:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-03-28 12:51:22,372 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:22,373 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:51:22,373 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-03-28 12:51:22,376 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-03-28 12:51:22,388 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:22,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:22,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 6 treesize of output 5 [2018-03-28 12:51:22,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:22,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:22,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:51:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:22,494 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:22,528 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:22,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:51:22,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:51:22,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:51:22,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:51:22,542 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-03-28 12:51:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:22,719 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-03-28 12:51:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:51:22,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-03-28 12:51:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:22,731 INFO L225 Difference]: With dead ends: 145 [2018-03-28 12:51:22,731 INFO L226 Difference]: Without dead ends: 102 [2018-03-28 12:51:22,736 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-03-28 12:51:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-03-28 12:51:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2018-03-28 12:51:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-28 12:51:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-28 12:51:22,771 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2018-03-28 12:51:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:22,772 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-28 12:51:22,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:51:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-28 12:51:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-03-28 12:51:22,772 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:22,773 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:51:22,773 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-03-28 12:51:22,773 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-03-28 12:51:22,782 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:22,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:22,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:51:22,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:22,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:22,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:51:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:22,847 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:22,927 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:22,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 12:51:22,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:51:22,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:51:22,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:51:22,929 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-03-28 12:51:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:23,102 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-03-28 12:51:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:51:23,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-03-28 12:51:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:23,106 INFO L225 Difference]: With dead ends: 157 [2018-03-28 12:51:23,106 INFO L226 Difference]: Without dead ends: 154 [2018-03-28 12:51:23,109 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-03-28 12:51:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-03-28 12:51:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 69. [2018-03-28 12:51:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-03-28 12:51:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-03-28 12:51:23,120 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 11 [2018-03-28 12:51:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:23,120 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-03-28 12:51:23,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:51:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-03-28 12:51:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-28 12:51:23,121 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:23,121 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-03-28 12:51:23,121 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-03-28 12:51:23,122 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-03-28 12:51:23,132 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:23,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:23,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:23,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:23,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:23,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:51:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:23,191 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:23,225 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:23,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:51:23,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:51:23,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:51:23,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:51:23,226 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-03-28 12:51:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:23,361 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-03-28 12:51:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:51:23,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-28 12:51:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:23,363 INFO L225 Difference]: With dead ends: 111 [2018-03-28 12:51:23,363 INFO L226 Difference]: Without dead ends: 110 [2018-03-28 12:51:23,364 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-03-28 12:51:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-03-28 12:51:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 68. [2018-03-28 12:51:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-03-28 12:51:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-03-28 12:51:23,371 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 21 [2018-03-28 12:51:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:23,371 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-03-28 12:51:23,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:51:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-03-28 12:51:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-28 12:51:23,373 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:23,373 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-03-28 12:51:23,373 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-03-28 12:51:23,373 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-03-28 12:51:23,381 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:23,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:23,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:23,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:23,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:23,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:51:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:23,501 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:23,561 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:23,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 12:51:23,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:51:23,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:51:23,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:51:23,562 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-03-28 12:51:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:23,764 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-03-28 12:51:23,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:51:23,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-28 12:51:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:23,766 INFO L225 Difference]: With dead ends: 126 [2018-03-28 12:51:23,766 INFO L226 Difference]: Without dead ends: 124 [2018-03-28 12:51:23,767 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-03-28 12:51:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-03-28 12:51:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 66. [2018-03-28 12:51:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-03-28 12:51:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-03-28 12:51:23,774 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2018-03-28 12:51:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:23,774 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-03-28 12:51:23,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:51:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-03-28 12:51:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-28 12:51:23,775 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:23,776 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-03-28 12:51:23,776 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-03-28 12:51:23,776 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-03-28 12:51:23,786 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:23,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:23,824 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:23,851 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:23,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-28 12:51:23,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 12:51:23,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 12:51:23,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:51:23,852 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2018-03-28 12:51:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:24,117 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-03-28 12:51:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:51:24,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-03-28 12:51:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:24,119 INFO L225 Difference]: With dead ends: 123 [2018-03-28 12:51:24,119 INFO L226 Difference]: Without dead ends: 120 [2018-03-28 12:51:24,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:51:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-03-28 12:51:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2018-03-28 12:51:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-28 12:51:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-03-28 12:51:24,127 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 22 [2018-03-28 12:51:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:24,128 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-03-28 12:51:24,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 12:51:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-03-28 12:51:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-28 12:51:24,129 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:24,129 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:51:24,129 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-03-28 12:51:24,129 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-03-28 12:51:24,136 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:24,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:24,174 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:24,214 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:24,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:51:24,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:51:24,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:51:24,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:51:24,215 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 4 states. [2018-03-28 12:51:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:24,269 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-03-28 12:51:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:51:24,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-03-28 12:51:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:24,270 INFO L225 Difference]: With dead ends: 88 [2018-03-28 12:51:24,270 INFO L226 Difference]: Without dead ends: 85 [2018-03-28 12:51:24,270 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-03-28 12:51:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-03-28 12:51:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-03-28 12:51:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-03-28 12:51:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-03-28 12:51:24,276 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 22 [2018-03-28 12:51:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:24,276 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-03-28 12:51:24,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:51:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-03-28 12:51:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-28 12:51:24,277 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:24,277 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-03-28 12:51:24,277 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-03-28 12:51:24,277 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-03-28 12:51:24,283 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:24,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:24,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:24,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:51:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:24,330 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:24,389 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:24,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 8 [2018-03-28 12:51:24,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-28 12:51:24,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-28 12:51:24,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-03-28 12:51:24,390 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 9 states. [2018-03-28 12:51:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:24,644 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-03-28 12:51:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-28 12:51:24,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-03-28 12:51:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:24,645 INFO L225 Difference]: With dead ends: 248 [2018-03-28 12:51:24,646 INFO L226 Difference]: Without dead ends: 243 [2018-03-28 12:51:24,646 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-03-28 12:51:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-03-28 12:51:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 107. [2018-03-28 12:51:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-03-28 12:51:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-03-28 12:51:24,654 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 22 [2018-03-28 12:51:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:24,654 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-03-28 12:51:24,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-28 12:51:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-03-28 12:51:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-03-28 12:51:24,655 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:24,655 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-03-28 12:51:24,655 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-03-28 12:51:24,655 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-03-28 12:51:24,661 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:24,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:24,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:51:24,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:51:24,712 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:24,712 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:24,714 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-03-28 12:51:24,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,721 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:24,722 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-03-28 12:51:24,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,728 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-03-28 12:51:24,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-03-28 12:51:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:24,744 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:24,815 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:51:24,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,825 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:51:24,826 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:51:24,827 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-03-28 12:51:24,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:24,834 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-03-28 12:51:24,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-03-28 12:51:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:24,894 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:24,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-03-28 12:51:24,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-28 12:51:24,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-28 12:51:24,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-03-28 12:51:24,895 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 10 states. [2018-03-28 12:51:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:25,196 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-03-28 12:51:25,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-28 12:51:25,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-03-28 12:51:25,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:25,197 INFO L225 Difference]: With dead ends: 153 [2018-03-28 12:51:25,197 INFO L226 Difference]: Without dead ends: 151 [2018-03-28 12:51:25,198 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-03-28 12:51:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-03-28 12:51:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2018-03-28 12:51:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-03-28 12:51:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-03-28 12:51:25,206 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 27 [2018-03-28 12:51:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:25,207 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-03-28 12:51:25,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-28 12:51:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-03-28 12:51:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-03-28 12:51:25,208 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:25,208 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-03-28 12:51:25,208 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-03-28 12:51:25,208 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-03-28 12:51:25,214 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:25,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:25,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:51:25,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:51:25,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,251 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-03-28 12:51:25,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:25,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-03-28 12:51:25,290 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-03-28 12:51:25,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-28 12:51:25,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,299 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-03-28 12:51:25,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:25,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:25,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:12 [2018-03-28 12:51:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:25,316 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:25,403 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:25,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-03-28 12:51:25,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-28 12:51:25,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-28 12:51:25,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-03-28 12:51:25,404 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 13 states. [2018-03-28 12:51:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:25,851 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-03-28 12:51:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-28 12:51:25,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-03-28 12:51:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:25,853 INFO L225 Difference]: With dead ends: 167 [2018-03-28 12:51:25,853 INFO L226 Difference]: Without dead ends: 129 [2018-03-28 12:51:25,854 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-03-28 12:51:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-03-28 12:51:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2018-03-28 12:51:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-28 12:51:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-03-28 12:51:25,862 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 29 [2018-03-28 12:51:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:25,862 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-03-28 12:51:25,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-28 12:51:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-03-28 12:51:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-28 12:51:25,864 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:25,864 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-03-28 12:51:25,864 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-03-28 12:51:25,864 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-03-28 12:51:25,870 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:25,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:25,940 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-03-28 12:51:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-03-28 12:51:25,945 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:25,969 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-03-28 12:51:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:25,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:51:25,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-28 12:51:25,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-28 12:51:25,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-28 12:51:25,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2018-03-28 12:51:25,997 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 11 states. [2018-03-28 12:51:26,005 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-03-28 12:51:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:26,149 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2018-03-28 12:51:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-28 12:51:26,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-03-28 12:51:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:26,151 INFO L225 Difference]: With dead ends: 131 [2018-03-28 12:51:26,151 INFO L226 Difference]: Without dead ends: 128 [2018-03-28 12:51:26,151 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-03-28 12:51:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-03-28 12:51:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-03-28 12:51:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-03-28 12:51:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-03-28 12:51:26,157 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 34 [2018-03-28 12:51:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:26,157 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-03-28 12:51:26,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-28 12:51:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-03-28 12:51:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-28 12:51:26,158 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:26,159 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-03-28 12:51:26,159 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-03-28 12:51:26,159 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-03-28 12:51:26,167 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:26,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:26,195 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-03-28 12:51:26,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:26,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 12:51:26,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:26,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-03-28 12:51:26,233 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-03-28 12:51:26,235 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,236 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-03-28 12:51:26,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,252 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-03-28 12:51:26,258 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-28 12:51:26,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-03-28 12:51:26,289 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-03-28 12:51:26,292 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,293 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,293 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,296 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-03-28 12:51:26,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,315 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-03-28 12:51:26,317 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,318 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,318 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,319 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,320 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-03-28 12:51:26,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-03-28 12:51:26,386 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-03-28 12:51:26,394 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-03-28 12:51:26,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,407 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-03-28 12:51:26,410 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:26,411 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-03-28 12:51:26,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2018-03-28 12:51:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:26,446 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:26,518 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:51:26,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:26,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:1 [2018-03-28 12:51:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:26,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:51:26,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2018-03-28 12:51:26,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-28 12:51:26,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-28 12:51:26,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-03-28 12:51:26,548 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 13 states. [2018-03-28 12:51:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:26,836 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2018-03-28 12:51:26,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-28 12:51:26,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-03-28 12:51:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:26,837 INFO L225 Difference]: With dead ends: 137 [2018-03-28 12:51:26,838 INFO L226 Difference]: Without dead ends: 91 [2018-03-28 12:51:26,838 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-03-28 12:51:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-03-28 12:51:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-03-28 12:51:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-03-28 12:51:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-03-28 12:51:26,844 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 34 [2018-03-28 12:51:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:26,844 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-03-28 12:51:26,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-28 12:51:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-03-28 12:51:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-03-28 12:51:26,845 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:26,846 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-03-28 12:51:26,846 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-03-28 12:51:26,846 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-03-28 12:51:26,852 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:26,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:26,885 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:26,911 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:26,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-28 12:51:26,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 12:51:26,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 12:51:26,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:51:26,912 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 5 states. [2018-03-28 12:51:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:26,970 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-03-28 12:51:26,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:51:26,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-03-28 12:51:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:26,971 INFO L225 Difference]: With dead ends: 127 [2018-03-28 12:51:26,971 INFO L226 Difference]: Without dead ends: 124 [2018-03-28 12:51:26,971 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-03-28 12:51:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-03-28 12:51:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2018-03-28 12:51:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-03-28 12:51:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-03-28 12:51:26,978 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 35 [2018-03-28 12:51:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:26,979 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-03-28 12:51:26,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 12:51:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-03-28 12:51:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-03-28 12:51:26,980 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:26,980 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-03-28 12:51:26,980 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-03-28 12:51:26,980 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-03-28 12:51:26,988 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:27,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:27,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:27,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:51:27,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:51:27,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-03-28 12:51:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:27,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:27,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:51:27,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-03-28 12:51:27,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:51:27,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:51:27,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-03-28 12:51:27,478 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 12 states. [2018-03-28 12:51:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:27,659 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-03-28 12:51:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-28 12:51:27,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-03-28 12:51:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:27,661 INFO L225 Difference]: With dead ends: 147 [2018-03-28 12:51:27,661 INFO L226 Difference]: Without dead ends: 144 [2018-03-28 12:51:27,661 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-03-28 12:51:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-03-28 12:51:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 93. [2018-03-28 12:51:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-03-28 12:51:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-03-28 12:51:27,668 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 35 [2018-03-28 12:51:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:27,668 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-03-28 12:51:27,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:51:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-03-28 12:51:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-03-28 12:51:27,669 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:27,669 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-03-28 12:51:27,669 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-03-28 12:51:27,669 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-03-28 12:51:27,678 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:27,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:27,729 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:27,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:27,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:10 [2018-03-28 12:51:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:27,786 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:27,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-03-28 12:51:27,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-28 12:51:27,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-28 12:51:27,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-03-28 12:51:27,787 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 9 states. [2018-03-28 12:51:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:27,933 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-03-28 12:51:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-28 12:51:27,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-03-28 12:51:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:27,934 INFO L225 Difference]: With dead ends: 130 [2018-03-28 12:51:27,935 INFO L226 Difference]: Without dead ends: 126 [2018-03-28 12:51:27,935 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-03-28 12:51:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-03-28 12:51:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2018-03-28 12:51:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-03-28 12:51:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-03-28 12:51:27,943 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 36 [2018-03-28 12:51:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:27,943 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-03-28 12:51:27,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-28 12:51:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-03-28 12:51:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-28 12:51:27,944 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:27,944 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-03-28 12:51:27,944 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-03-28 12:51:27,944 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-03-28 12:51:27,950 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:27,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:27,983 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-03-28 12:51:27,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:27,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:27,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-03-28 12:51:28,015 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-03-28 12:51:28,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:28,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-03-28 12:51:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:28,036 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:28,099 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:28,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-03-28 12:51:28,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-28 12:51:28,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-28 12:51:28,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-03-28 12:51:28,100 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 14 states. [2018-03-28 12:51:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:28,339 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-03-28 12:51:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-28 12:51:28,340 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-03-28 12:51:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:28,341 INFO L225 Difference]: With dead ends: 182 [2018-03-28 12:51:28,341 INFO L226 Difference]: Without dead ends: 181 [2018-03-28 12:51:28,342 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-03-28 12:51:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-03-28 12:51:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 95. [2018-03-28 12:51:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-03-28 12:51:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-03-28 12:51:28,349 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 43 [2018-03-28 12:51:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:28,349 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-03-28 12:51:28,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-28 12:51:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-03-28 12:51:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-03-28 12:51:28,350 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:28,350 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-03-28 12:51:28,350 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-03-28 12:51:28,351 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-03-28 12:51:28,357 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:28,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:28,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:28,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:51:28,392 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-03-28 12:51:28,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:28,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-03-28 12:51:28,436 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-03-28 12:51:28,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:28,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-03-28 12:51:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:28,452 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:28,532 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:28,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-03-28 12:51:28,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-28 12:51:28,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-28 12:51:28,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-03-28 12:51:28,534 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 14 states. [2018-03-28 12:51:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:28,867 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-03-28 12:51:28,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-03-28 12:51:28,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-03-28 12:51:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:28,868 INFO L225 Difference]: With dead ends: 149 [2018-03-28 12:51:28,868 INFO L226 Difference]: Without dead ends: 148 [2018-03-28 12:51:28,869 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-03-28 12:51:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-03-28 12:51:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2018-03-28 12:51:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-03-28 12:51:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-03-28 12:51:28,876 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 44 [2018-03-28 12:51:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:28,877 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-03-28 12:51:28,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-28 12:51:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-03-28 12:51:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-28 12:51:28,877 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:28,878 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-03-28 12:51:28,878 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-03-28 12:51:28,878 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-03-28 12:51:28,890 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:28,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:28,923 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:28,924 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:28,924 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-03-28 12:51:28,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-03-28 12:51:28,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, 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-03-28 12:51:28,944 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-03-28 12:51:28,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-03-28 12:51:28,963 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-03-28 12:51:28,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:28,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:28,974 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-03-28 12:51:28,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-03-28 12:51:28,992 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-03-28 12:51:28,994 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:28,995 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-03-28 12:51:28,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,006 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-03-28 12:51:29,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-03-28 12:51:29,050 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-03-28 12:51:29,052 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-03-28 12:51:29,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-03-28 12:51:29,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,062 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2018-03-28 12:51:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:29,083 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:29,134 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-03-28 12:51:29,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:29,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,155 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-03-28 12:51:29,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:29,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2018-03-28 12:51:29,279 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:51:29,280 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:51:29,280 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-03-28 12:51:29,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:29,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-03-28 12:51:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:29,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:51:29,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-03-28 12:51:29,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-28 12:51:29,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-28 12:51:29,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-03-28 12:51:29,312 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 21 states. [2018-03-28 12:51:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:30,161 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-03-28 12:51:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-03-28 12:51:30,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-03-28 12:51:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:30,162 INFO L225 Difference]: With dead ends: 199 [2018-03-28 12:51:30,162 INFO L226 Difference]: Without dead ends: 196 [2018-03-28 12:51:30,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=409, Invalid=1661, Unknown=0, NotChecked=0, Total=2070 [2018-03-28 12:51:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-03-28 12:51:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 147. [2018-03-28 12:51:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-03-28 12:51:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-03-28 12:51:30,173 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 47 [2018-03-28 12:51:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:30,173 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-03-28 12:51:30,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-28 12:51:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-03-28 12:51:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-28 12:51:30,174 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:30,174 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-03-28 12:51:30,174 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-03-28 12:51:30,174 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-03-28 12:51:30,184 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:30,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:30,207 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:30,208 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:30,208 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-03-28 12:51:30,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-28 12:51:30,223 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-03-28 12:51:30,224 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-03-28 12:51:30,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-03-28 12:51:30,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-03-28 12:51:30,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:30,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,251 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-03-28 12:51:30,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-03-28 12:51:30,269 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-03-28 12:51:30,271 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:30,272 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-03-28 12:51:30,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,283 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-03-28 12:51:30,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-03-28 12:51:30,337 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-03-28 12:51:30,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:51:30,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-03-28 12:51:30,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,351 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:10 [2018-03-28 12:51:30,379 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:30,380 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-03-28 12:51:30,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,384 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-03-28 12:51:30,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-03-28 12:51:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:30,403 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:30,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:30,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,472 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-03-28 12:51:30,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,477 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-03-28 12:51:30,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2018-03-28 12:51:30,948 WARN L148 SmtUtils]: Spent 449ms on a formula simplification that was a NOOP. DAG size: 24 [2018-03-28 12:51:30,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-03-28 12:51:30,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:30,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,975 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-03-28 12:51:30,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:30,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:30,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:8 [2018-03-28 12:51:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:31,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:51:31,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-03-28 12:51:31,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-03-28 12:51:31,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-03-28 12:51:31,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-03-28 12:51:31,081 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 22 states. [2018-03-28 12:51:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:32,133 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-03-28 12:51:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-28 12:51:32,133 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-03-28 12:51:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:32,134 INFO L225 Difference]: With dead ends: 207 [2018-03-28 12:51:32,134 INFO L226 Difference]: Without dead ends: 205 [2018-03-28 12:51:32,134 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-03-28 12:51:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-03-28 12:51:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2018-03-28 12:51:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-03-28 12:51:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2018-03-28 12:51:32,142 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 47 [2018-03-28 12:51:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:32,142 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2018-03-28 12:51:32,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-03-28 12:51:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2018-03-28 12:51:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-28 12:51:32,142 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:32,143 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-03-28 12:51:32,143 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-03-28 12:51:32,143 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-03-28 12:51:32,149 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:32,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:32,183 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:32,183 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:32,184 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-03-28 12:51:32,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-28 12:51:32,204 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-03-28 12:51:32,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-28 12:51:32,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,217 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-03-28 12:51:32,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-03-28 12:51:32,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-03-28 12:51:32,247 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-03-28 12:51:32,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:32,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,266 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-03-28 12:51:32,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:32,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2018-03-28 12:51:32,302 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-03-28 12:51:32,305 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:32,306 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:32,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:32,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,330 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-03-28 12:51:32,334 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:32,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:32,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-03-28 12:51:32,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-03-28 12:51:32,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-28 12:51:32,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,420 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-03-28 12:51:32,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,434 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-03-28 12:51:32,437 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:32,438 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-03-28 12:51:32,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,442 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,446 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2018-03-28 12:51:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:32,488 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:32,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:32,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:51:32,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:51:32,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:51:32,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-03-28 12:51:32,737 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:51:32,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,760 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-03-28 12:51:32,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:32,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-28 12:51:32,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:51:32,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:32,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:51:32,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:51:32,833 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:132, output treesize:35 [2018-03-28 12:51:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:33,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:51:33,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-03-28 12:51:33,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-28 12:51:33,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-28 12:51:33,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-03-28 12:51:33,190 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 25 states. [2018-03-28 12:51:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:34,914 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2018-03-28 12:51:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-03-28 12:51:34,914 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-03-28 12:51:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:34,915 INFO L225 Difference]: With dead ends: 256 [2018-03-28 12:51:34,915 INFO L226 Difference]: Without dead ends: 254 [2018-03-28 12:51:34,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1039, Invalid=2867, Unknown=0, NotChecked=0, Total=3906 [2018-03-28 12:51:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-03-28 12:51:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 192. [2018-03-28 12:51:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-03-28 12:51:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2018-03-28 12:51:34,924 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 47 [2018-03-28 12:51:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:34,924 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2018-03-28 12:51:34,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-28 12:51:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2018-03-28 12:51:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-03-28 12:51:34,924 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:34,924 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-03-28 12:51:34,925 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-03-28 12:51:34,925 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-03-28 12:51:34,930 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:34,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:34,965 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:34,965 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:34,966 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-03-28 12:51:34,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:34,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:34,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-28 12:51:34,977 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-03-28 12:51:34,978 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-03-28 12:51:34,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:34,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:34,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:34,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-03-28 12:51:35,017 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-03-28 12:51:35,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:35,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-03-28 12:51:35,046 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:35,047 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-03-28 12:51:35,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,052 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-03-28 12:51:35,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-03-28 12:51:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:35,067 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:35,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:35,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-03-28 12:51:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:35,179 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:51:35,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2018-03-28 12:51:35,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-03-28 12:51:35,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-03-28 12:51:35,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-03-28 12:51:35,180 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand 20 states. [2018-03-28 12:51:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:51:35,631 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2018-03-28 12:51:35,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-03-28 12:51:35,631 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-03-28 12:51:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:51:35,632 INFO L225 Difference]: With dead ends: 211 [2018-03-28 12:51:35,632 INFO L226 Difference]: Without dead ends: 210 [2018-03-28 12:51:35,633 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-03-28 12:51:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-03-28 12:51:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2018-03-28 12:51:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-03-28 12:51:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-03-28 12:51:35,641 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 48 [2018-03-28 12:51:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:51:35,642 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-03-28 12:51:35,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-03-28 12:51:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-03-28 12:51:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-28 12:51:35,643 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:51:35,643 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-03-28 12:51:35,643 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-03-28 12:51:35,643 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-03-28 12:51:35,650 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:51:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:51:35,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:51:35,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:35,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:51:35,695 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:35,696 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:35,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:51:35,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:35,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-03-28 12:51:35,731 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-03-28 12:51:35,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:35,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:35,749 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-03-28 12:51:35,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:35 [2018-03-28 12:51:35,778 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-03-28 12:51:35,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:35,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,796 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-03-28 12:51:35,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:35,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-03-28 12:51:35,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-03-28 12:51:35,834 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:35,835 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:35,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 18 treesize of output 35 [2018-03-28 12:51:35,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,865 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-03-28 12:51:35,868 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:35,868 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-03-28 12:51:35,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-03-28 12:51:35,934 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-03-28 12:51:35,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:35,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,946 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-03-28 12:51:35,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,959 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-03-28 12:51:35,961 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:51:35,961 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-03-28 12:51:35,961 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:35,968 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-03-28 12:51:35,969 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-03-28 12:51:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:36,047 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:51:36,179 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-03-28 12:51:36,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:36,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:51:36,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:36,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-03-28 12:51:36,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:51:36,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,264 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-03-28 12:51:36,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:36,265 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,268 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,269 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-03-28 12:51:36,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:51:36,271 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,274 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:51:36,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:51:36,298 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:105, output treesize:38 [2018-03-28 12:51:36,403 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:51:36,404 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:51:36,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:51:36,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:51:36,409 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-03-28 12:51:36,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-03-28 12:51:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:51:36,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:51:36,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-03-28 12:51:36,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-03-28 12:51:36,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-03-28 12:51:36,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-03-28 12:51:36,488 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 29 states. [2018-03-28 12:51:37,475 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 110 DAG size of output 83 [2018-03-28 12:51:38,391 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 96 DAG size of output 73 [2018-03-28 12:52:02,871 WARN L151 SmtUtils]: Spent 24119ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-03-28 12:52:03,219 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 105 DAG size of output 78 [2018-03-28 12:52:03,862 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-03-28 12:52:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:52:04,438 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2018-03-28 12:52:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-03-28 12:52:04,438 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-03-28 12:52:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:52:04,439 INFO L225 Difference]: With dead ends: 325 [2018-03-28 12:52:04,440 INFO L226 Difference]: Without dead ends: 324 [2018-03-28 12:52:04,441 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-03-28 12:52:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-03-28 12:52:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 195. [2018-03-28 12:52:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-03-28 12:52:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-03-28 12:52:04,451 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 50 [2018-03-28 12:52:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:52:04,452 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-03-28 12:52:04,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-03-28 12:52:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-03-28 12:52:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-28 12:52:04,453 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:52:04,453 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-03-28 12:52:04,453 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-03-28 12:52:04,453 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-03-28 12:52:04,462 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:52:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:52:04,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:52:04,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,493 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-03-28 12:52:04,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-28 12:52:04,507 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-03-28 12:52:04,509 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-03-28 12:52:04,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-03-28 12:52:04,525 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-03-28 12:52:04,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:52:04,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,535 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-03-28 12:52:04,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-03-28 12:52:04,560 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,567 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,568 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-03-28 12:52:04,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,617 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-03-28 12:52:04,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:47 [2018-03-28 12:52:04,661 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-03-28 12:52:04,664 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,664 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-03-28 12:52:04,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,683 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-03-28 12:52:04,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:59 [2018-03-28 12:52:04,847 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-03-28 12:52:04,856 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-03-28 12:52:04,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:52:04,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:19 [2018-03-28 12:52:04,893 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,894 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-03-28 12:52:04,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,899 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-03-28 12:52:04,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-03-28 12:52:04,935 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,937 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:04,938 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-03-28 12:52:04,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:04,964 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-03-28 12:52:04,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-28 12:52:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:52:05,024 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:52:05,175 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:05,176 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:05,176 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-03-28 12:52:05,194 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:05,194 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:05,195 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-03-28 12:52:05,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:05,196 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:05,198 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:05,204 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-03-28 12:52:05,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-28 12:52:05,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:52:05,226 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-03-28 12:52:05,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:60 [2018-03-28 12:52:06,690 WARN L148 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 38 [2018-03-28 12:52:06,694 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:52:06,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,701 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-03-28 12:52:06,703 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-03-28 12:52:06,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,710 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:06,712 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-03-28 12:52:06,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:52:06,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,720 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-03-28 12:52:06,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:52:06,723 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,724 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:06,730 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:100, output treesize:8 [2018-03-28 12:52:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:52:06,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:52:06,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-03-28 12:52:06,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-28 12:52:06,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-28 12:52:06,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-03-28 12:52:06,822 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 31 states. [2018-03-28 12:52:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:52:08,408 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-03-28 12:52:08,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-28 12:52:08,408 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-03-28 12:52:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:52:08,410 INFO L225 Difference]: With dead ends: 208 [2018-03-28 12:52:08,410 INFO L226 Difference]: Without dead ends: 206 [2018-03-28 12:52:08,411 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-03-28 12:52:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-03-28 12:52:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2018-03-28 12:52:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-03-28 12:52:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-03-28 12:52:08,418 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 53 [2018-03-28 12:52:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:52:08,418 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-03-28 12:52:08,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-28 12:52:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-03-28 12:52:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-28 12:52:08,418 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:52:08,419 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-03-28 12:52:08,419 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-03-28 12:52:08,419 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-03-28 12:52:08,438 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:52:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:52:08,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:52:08,476 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-03-28 12:52:08,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:52:08,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,487 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-03-28 12:52:08,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:52:08,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-03-28 12:52:08,512 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,513 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:52:08,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-03-28 12:52:08,544 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-03-28 12:52:08,546 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-03-28 12:52:08,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,562 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-03-28 12:52:08,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:52:08,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-03-28 12:52:08,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-03-28 12:52:08,598 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,599 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-03-28 12:52:08,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,621 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-03-28 12:52:08,623 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,624 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-03-28 12:52:08,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:67 [2018-03-28 12:52:08,659 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,660 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-03-28 12:52:08,662 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,663 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-03-28 12:52:08,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,689 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-03-28 12:52:08,692 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,692 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,693 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-03-28 12:52:08,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-03-28 12:52:08,898 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,898 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-03-28 12:52:08,901 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:08,904 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,912 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-03-28 12:52:08,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:52:08,930 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,930 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-03-28 12:52:08,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,945 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-03-28 12:52:08,946 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:52:08,947 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,947 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-03-28 12:52:08,948 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,955 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:52:08,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:52:08,955 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:08,962 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:110, output treesize:12 [2018-03-28 12:52:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:52:08,992 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:52:10,090 WARN L148 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 72 [2018-03-28 12:52:11,365 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:52:11,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:52:11,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:52:11,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:961, output treesize:1 [2018-03-28 12:52:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:52:11,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:52:11,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2018-03-28 12:52:11,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-28 12:52:11,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-28 12:52:11,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-03-28 12:52:11,410 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 31 states. [2018-03-28 12:52:13,077 WARN L151 SmtUtils]: Spent 874ms on a formula simplification. DAG size of input: 155 DAG size of output 131 [2018-03-28 12:52:13,411 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 106 DAG size of output 98 [2018-03-28 12:52:13,886 WARN L151 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 124 DAG size of output 104 [2018-03-28 12:52:15,390 WARN L151 SmtUtils]: Spent 911ms on a formula simplification. DAG size of input: 161 DAG size of output 135 [2018-03-28 12:52:15,994 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 148 DAG size of output 109 [2018-03-28 12:52:16,363 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 123 DAG size of output 84 [2018-03-28 12:52:16,700 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 127 DAG size of output 88 [2018-03-28 12:52:17,172 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-03-28 12:52:17,520 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 119 DAG size of output 80 [2018-03-28 12:52:18,116 WARN L151 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 99 DAG size of output 87 [2018-03-28 12:52:33,183 WARN L151 SmtUtils]: Spent 11808ms on a formula simplification. DAG size of input: 128 DAG size of output 122 [2018-03-28 12:52:33,596 WARN L151 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-03-28 12:52:35,470 WARN L151 SmtUtils]: Spent 1223ms on a formula simplification. DAG size of input: 131 DAG size of output 119 [2018-03-28 12:52:36,839 WARN L151 SmtUtils]: Spent 1154ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-03-28 12:52:38,311 WARN L151 SmtUtils]: Spent 1113ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-03-28 12:52:38,582 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 89 DAG size of output 83 [2018-03-28 12:52:38,895 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 90 [2018-03-28 12:52:39,948 WARN L151 SmtUtils]: Spent 513ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-03-28 12:52:40,443 WARN L151 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-03-28 12:53:19,161 WARN L151 SmtUtils]: Spent 36533ms on a formula simplification. DAG size of input: 154 DAG size of output 148 [2018-03-28 12:53:25,004 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-03-28 12:53:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:25,378 INFO L93 Difference]: Finished difference Result 374 states and 403 transitions. [2018-03-28 12:53:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-03-28 12:53:25,379 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-03-28 12:53:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:25,380 INFO L225 Difference]: With dead ends: 374 [2018-03-28 12:53:25,380 INFO L226 Difference]: Without dead ends: 336 [2018-03-28 12:53:25,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=1217, Invalid=6265, Unknown=0, NotChecked=0, Total=7482 [2018-03-28 12:53:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-03-28 12:53:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 261. [2018-03-28 12:53:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-03-28 12:53:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 284 transitions. [2018-03-28 12:53:25,394 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 284 transitions. Word has length 54 [2018-03-28 12:53:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:25,394 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 284 transitions. [2018-03-28 12:53:25,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-28 12:53:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 284 transitions. [2018-03-28 12:53:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-28 12:53:25,394 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:25,394 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-03-28 12:53:25,395 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-03-28 12:53:25,395 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-03-28 12:53:25,405 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:25,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:25,596 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:25,603 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:25,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:53:25,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-28 12:53:25,625 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-03-28 12:53:25,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:25,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-03-28 12:53:25,677 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-03-28 12:53:25,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:53:25,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,737 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-03-28 12:53:25,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-03-28 12:53:25,759 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-03-28 12:53:25,761 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:25,762 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-03-28 12:53:25,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,775 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-03-28 12:53:25,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-03-28 12:53:25,793 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-03-28 12:53:25,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 11 treesize of output 3 [2018-03-28 12:53:25,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-03-28 12:53:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:25,817 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:25,859 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-03-28 12:53:25,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:53:25,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,884 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-03-28 12:53:25,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:53:25,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,890 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-03-28 12:53:25,891 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-03-28 12:53:25,892 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,893 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:53:25,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:53:25,916 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:38, output treesize:43 [2018-03-28 12:53:26,051 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:26,051 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:26,052 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-03-28 12:53:26,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,074 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:26,075 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:26,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-03-28 12:53:26,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:53:26,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:13 [2018-03-28 12:53:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:26,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:53:26,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-03-28 12:53:26,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-03-28 12:53:26,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-03-28 12:53:26,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-03-28 12:53:26,112 INFO L87 Difference]: Start difference. First operand 261 states and 284 transitions. Second operand 20 states. [2018-03-28 12:53:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:26,899 INFO L93 Difference]: Finished difference Result 297 states and 321 transitions. [2018-03-28 12:53:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-28 12:53:26,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-03-28 12:53:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:26,902 INFO L225 Difference]: With dead ends: 297 [2018-03-28 12:53:26,903 INFO L226 Difference]: Without dead ends: 296 [2018-03-28 12:53:26,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=477, Invalid=1163, Unknown=0, NotChecked=0, Total=1640 [2018-03-28 12:53:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-03-28 12:53:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 232. [2018-03-28 12:53:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-03-28 12:53:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2018-03-28 12:53:26,915 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 54 [2018-03-28 12:53:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:26,915 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2018-03-28 12:53:26,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-03-28 12:53:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2018-03-28 12:53:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-03-28 12:53:26,915 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:26,916 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-03-28 12:53:26,916 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-03-28 12:53:26,916 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-03-28 12:53:26,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:26,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:26,994 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-03-28 12:53:26,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:53:26,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-03-28 12:53:27,023 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:27,026 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-03-28 12:53:27,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:53:27,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,043 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-03-28 12:53:27,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-03-28 12:53:27,067 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:27,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-03-28 12:53:27,073 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:27,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-28 12:53:27,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,092 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-03-28 12:53:27,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-03-28 12:53:27,168 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:27,169 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-03-28 12:53:27,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-28 12:53:27,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,181 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:27,181 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-03-28 12:53:27,181 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,191 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:23 [2018-03-28 12:53:27,288 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-03-28 12:53:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-03-28 12:53:27,301 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:27,438 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-03-28 12:53:27,442 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-03-28 12:53:27,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:53:27,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,465 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-03-28 12:53:27,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-03-28 12:53:27,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:27,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14 [2018-03-28 12:53:27,514 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-03-28 12:53:27,517 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-03-28 12:53:27,577 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-03-28 12:53:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-03-28 12:53:27,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:53:27,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-03-28 12:53:27,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-03-28 12:53:27,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-03-28 12:53:27,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=665, Unknown=18, NotChecked=280, Total=1056 [2018-03-28 12:53:27,609 INFO L87 Difference]: Start difference. First operand 232 states and 253 transitions. Second operand 33 states. [2018-03-28 12:53:27,635 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-03-28 12:53:27,814 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-03-28 12:53:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:28,597 INFO L93 Difference]: Finished difference Result 277 states and 299 transitions. [2018-03-28 12:53:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-28 12:53:28,597 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-03-28 12:53:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:28,599 INFO L225 Difference]: With dead ends: 277 [2018-03-28 12:53:28,599 INFO L226 Difference]: Without dead ends: 274 [2018-03-28 12:53:28,599 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=1357, Unknown=26, NotChecked=574, Total=2162 [2018-03-28 12:53:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-03-28 12:53:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2018-03-28 12:53:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-03-28 12:53:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2018-03-28 12:53:28,611 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 59 [2018-03-28 12:53:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:28,611 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2018-03-28 12:53:28,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-03-28 12:53:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2018-03-28 12:53:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-03-28 12:53:28,611 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:28,612 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-03-28 12:53:28,612 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-03-28 12:53:28,612 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-03-28 12:53:28,618 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:28,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:28,681 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-03-28 12:53:28,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:28,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,693 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-03-28 12:53:28,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-28 12:53:28,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-03-28 12:53:28,713 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-03-28 12:53:28,715 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,716 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-03-28 12:53:28,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,729 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-03-28 12:53:28,734 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,735 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-03-28 12:53:28,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-03-28 12:53:28,760 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-03-28 12:53:28,762 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,763 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,763 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,764 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,765 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-03-28 12:53:28,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,788 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-03-28 12:53:28,790 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,790 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,791 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,793 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-03-28 12:53:28,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-03-28 12:53:28,841 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,841 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:53:28,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-03-28 12:53:28,890 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-03-28 12:53:28,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:28,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,920 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-03-28 12:53:28,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, 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-03-28 12:53:28,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:67 [2018-03-28 12:53:28,972 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-03-28 12:53:28,975 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,977 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-03-28 12:53:28,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,005 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:29,006 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-03-28 12:53:29,008 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,009 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-03-28 12:53:29,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-03-28 12:53:29,055 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-03-28 12:53:29,057 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,058 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,059 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-03-28 12:53:29,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,088 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,089 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-03-28 12:53:29,091 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,092 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-03-28 12:53:29,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:109 [2018-03-28 12:53:29,227 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,228 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-03-28 12:53:29,243 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,255 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-03-28 12:53:29,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-03-28 12:53:29,281 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-03-28 12:53:29,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:29,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:29,300 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-03-28 12:53:29,302 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-28 12:53:29,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,310 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:29,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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-03-28 12:53:29,311 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,320 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:7 [2018-03-28 12:53:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:29,366 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-03-28 12:53:54,447 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-28 12:53:54,448 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-28 12:53:54,451 WARN L197 ceAbstractionStarter]: Timeout [2018-03-28 12:53:54,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:53:54 BoogieIcfgContainer [2018-03-28 12:53:54,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-28 12:53:54,452 INFO L168 Benchmark]: Toolchain (without parser) took 153094.34 ms. Allocated memory was 304.6 MB in the beginning and 643.3 MB in the end (delta: 338.7 MB). Free memory was 241.8 MB in the beginning and 448.5 MB in the end (delta: -206.7 MB). Peak memory consumption was 132.0 MB. Max. memory is 5.3 GB. [2018-03-28 12:53:54,453 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 304.6 MB. Free memory is still 265.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-28 12:53:54,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.98 ms. Allocated memory is still 304.6 MB. Free memory was 241.8 MB in the beginning and 217.8 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-03-28 12:53:54,453 INFO L168 Benchmark]: Boogie Preprocessor took 52.76 ms. Allocated memory is still 304.6 MB. Free memory was 217.8 MB in the beginning and 213.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-03-28 12:53:54,454 INFO L168 Benchmark]: RCFGBuilder took 521.96 ms. Allocated memory was 304.6 MB in the beginning and 466.1 MB in the end (delta: 161.5 MB). Free memory was 213.8 MB in the beginning and 400.0 MB in the end (delta: -186.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 5.3 GB. [2018-03-28 12:53:54,454 INFO L168 Benchmark]: TraceAbstraction took 152166.03 ms. Allocated memory was 466.1 MB in the beginning and 643.3 MB in the end (delta: 177.2 MB). Free memory was 400.0 MB in the beginning and 448.5 MB in the end (delta: -48.5 MB). Peak memory consumption was 128.7 MB. Max. memory is 5.3 GB. [2018-03-28 12:53:54,455 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.28 ms. Allocated memory is still 304.6 MB. Free memory is still 265.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 346.98 ms. Allocated memory is still 304.6 MB. Free memory was 241.8 MB in the beginning and 217.8 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.76 ms. Allocated memory is still 304.6 MB. Free memory was 217.8 MB in the beginning and 213.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 521.96 ms. Allocated memory was 304.6 MB in the beginning and 466.1 MB in the end (delta: 161.5 MB). Free memory was 213.8 MB in the beginning and 400.0 MB in the end (delta: -186.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 152166.03 ms. Allocated memory was 466.1 MB in the beginning and 643.3 MB in the end (delta: 177.2 MB). Free memory was 400.0 MB in the beginning and 448.5 MB in the end (delta: -48.5 MB). Peak memory consumption was 128.7 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 25 error locations. TIMEOUT Result, 152.1s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 112.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1453 SDtfs, 6870 SDslu, 8555 SDs, 0 SdLazy, 7738 SolverSat, 1464 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2182 GetRequests, 1466 SyntacticMatches, 22 SemanticMatches, 694 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 7785 ImplicationChecksByTransitivity, 107.9s 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, 25 MinimizatonAttempts, 1248 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1762 ConstructedInterpolants, 223 QuantifiedInterpolants, 1177854 SizeOfPredicates, 251 NumberOfNonLiveVariables, 3291 ConjunctsInSsa, 524 ConjunctsInUnsatCore, 50 InterpolantComputations, 28 PerfectInterpolantSequences, 44/216 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-03-28_12-53-54-462.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-03-28_12-53-54-462.csv Completed graceful shutdown