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-8168ed2-m [2018-04-11 21:26:40,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 21:26:40,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 21:26:40,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 21:26:40,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 21:26:40,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 21:26:40,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 21:26:40,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 21:26:40,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 21:26:40,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 21:26:40,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 21:26:40,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 21:26:40,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 21:26:40,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 21:26:40,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 21:26:40,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 21:26:40,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 21:26:40,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 21:26:40,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 21:26:40,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 21:26:40,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 21:26:40,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 21:26:40,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 21:26:40,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 21:26:40,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 21:26:40,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 21:26:40,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 21:26:40,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 21:26:40,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 21:26:40,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 21:26:40,615 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 21:26:40,615 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 21:26:40,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 21:26:40,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 21:26:40,640 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 21:26:40,640 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 21:26:40,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 21:26:40,641 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 21:26:40,641 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 21:26:40,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 21:26:40,642 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 21:26:40,642 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 21:26:40,642 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 21:26:40,642 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 21:26:40,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 21:26:40,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 21:26:40,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 21:26:40,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 21:26:40,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 21:26:40,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 21:26:40,644 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 21:26:40,644 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 21:26:40,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 21:26:40,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 21:26:40,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 21:26:40,645 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 21:26:40,645 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 21:26:40,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 21:26:40,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:26:40,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 21:26:40,646 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 21:26:40,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 21:26:40,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 21:26:40,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 21:26:40,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:40,646 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 21:26:40,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 21:26:40,647 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 21:26:40,648 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 21:26:40,648 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 21:26:40,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 21:26:40,696 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 21:26:40,700 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 21:26:40,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 21:26:40,703 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 21:26:40,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,022 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGec3f4bf56 [2018-04-11 21:26:41,209 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 21:26:41,210 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 21:26:41,210 INFO L168 CDTParser]: Scanning dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,221 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 21:26:41,222 INFO L215 ultiparseSymbolTable]: [2018-04-11 21:26:41,222 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 21:26:41,222 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,222 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 21:26:41,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____WAIT_STATUS in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ushort in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_cond_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrier_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_spinlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Node in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__id_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__wchar_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_int in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____useconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_char in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_attr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pthread_list_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrierattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____swblk_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_once_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_long in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ulong in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____qaddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_short in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_condattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_set in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_long in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutex_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_short in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__size_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____intptr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____time_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,229 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutexattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__off_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__div_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__register_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__time_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__lldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Data in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____socklen_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_char in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uint in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____id_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlockattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,235 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,235 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,235 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sig_atomic_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:41,272 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGec3f4bf56 [2018-04-11 21:26:41,276 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 21:26:41,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 21:26:41,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 21:26:41,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 21:26:41,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 21:26:41,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ef731c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41, skipping insertion in model container [2018-04-11 21:26:41,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,301 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:26:41,333 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:26:41,501 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:26:41,546 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:26:41,554 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 21:26:41,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41 WrapperNode [2018-04-11 21:26:41,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 21:26:41,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 21:26:41,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 21:26:41,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 21:26:41,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... [2018-04-11 21:26:41,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 21:26:41,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 21:26:41,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 21:26:41,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 21:26:41,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:26:41,798 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 21:26:41,799 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 21:26:41,799 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 21:26:41,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 21:26:41,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 21:26:41,799 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 21:26:41,799 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 21:26:41,799 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 21:26:41,799 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 21:26:41,800 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 21:26:41,800 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 21:26:41,800 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 21:26:41,800 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 21:26:41,800 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 21:26:41,800 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 21:26:41,800 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 21:26:41,801 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 21:26:41,801 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 21:26:41,801 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 21:26:41,801 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 21:26:41,801 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 21:26:41,802 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 21:26:41,802 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 21:26:41,802 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 21:26:41,802 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 21:26:41,802 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 21:26:41,803 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 21:26:41,804 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 21:26:41,804 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 21:26:41,804 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 21:26:41,804 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 21:26:41,804 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 21:26:41,804 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 21:26:41,804 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 21:26:41,805 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 21:26:41,805 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 21:26:41,805 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 21:26:41,805 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 21:26:41,805 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 21:26:41,805 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 21:26:41,805 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 21:26:41,806 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 21:26:41,807 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 21:26:41,808 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 21:26:41,808 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 21:26:41,808 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 21:26:41,808 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 21:26:41,808 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 21:26:41,808 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 21:26:41,808 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 21:26:41,809 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 21:26:41,810 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 21:26:41,811 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 21:26:41,811 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 21:26:41,811 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 21:26:41,811 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 21:26:41,811 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 21:26:41,811 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 21:26:41,811 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 21:26:41,812 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 21:26:41,813 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 21:26:41,814 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 21:26:41,814 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 21:26:41,814 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 21:26:42,187 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 21:26:42,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:26:42 BoogieIcfgContainer [2018-04-11 21:26:42,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 21:26:42,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 21:26:42,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 21:26:42,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 21:26:42,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:26:41" (1/3) ... [2018-04-11 21:26:42,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb11130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:26:42, skipping insertion in model container [2018-04-11 21:26:42,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:26:41" (2/3) ... [2018-04-11 21:26:42,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb11130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:26:42, skipping insertion in model container [2018-04-11 21:26:42,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:26:42" (3/3) ... [2018-04-11 21:26:42,193 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-04-11 21:26:42,202 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 21:26:42,210 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-04-11 21:26:42,256 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 21:26:42,256 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 21:26:42,256 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 21:26:42,256 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 21:26:42,256 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 21:26:42,257 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 21:26:42,257 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 21:26:42,257 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 21:26:42,257 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 21:26:42,257 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 21:26:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-04-11 21:26:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 21:26:42,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:42,277 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:42,277 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1298363538, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:42,294 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:42,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:42,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:42,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:42,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:42,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:26:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:42,413 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:42,469 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:42,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:26:42,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:26:42,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:26:42,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:26:42,489 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-04-11 21:26:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:42,717 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-04-11 21:26:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:26:42,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-04-11 21:26:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:42,728 INFO L225 Difference]: With dead ends: 145 [2018-04-11 21:26:42,728 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 21:26:42,731 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:26:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 21:26:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2018-04-11 21:26:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 21:26:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-11 21:26:42,773 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2018-04-11 21:26:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:42,774 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-11 21:26:42,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:26:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-11 21:26:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 21:26:42,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:42,775 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:42,775 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1298363537, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:42,781 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:42,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:42,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:42,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:42,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:42,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:26:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:42,879 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:42,932 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:42,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 21:26:42,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:26:42,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:26:42,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:26:42,935 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-04-11 21:26:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:43,112 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-04-11 21:26:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:26:43,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-04-11 21:26:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:43,115 INFO L225 Difference]: With dead ends: 157 [2018-04-11 21:26:43,115 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 21:26:43,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:26:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 21:26:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 69. [2018-04-11 21:26:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 21:26:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-04-11 21:26:43,127 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 11 [2018-04-11 21:26:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:43,128 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-04-11 21:26:43,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:26:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-04-11 21:26:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 21:26:43,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:43,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] [2018-04-11 21:26:43,129 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1953155203, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:43,140 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:43,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:43,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:43,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:43,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:43,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:26:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:43,186 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:43,228 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:43,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:26:43,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:26:43,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:26:43,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:26:43,229 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-04-11 21:26:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:43,361 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-04-11 21:26:43,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:26:43,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-11 21:26:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:43,363 INFO L225 Difference]: With dead ends: 111 [2018-04-11 21:26:43,363 INFO L226 Difference]: Without dead ends: 110 [2018-04-11 21:26:43,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:26:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-11 21:26:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 68. [2018-04-11 21:26:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 21:26:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-11 21:26:43,369 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 21 [2018-04-11 21:26:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:43,370 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-11 21:26:43,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:26:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-11 21:26:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 21:26:43,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:43,371 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:43,371 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1953155202, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:43,378 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:43,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:43,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:43,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:43,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:43,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:26:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:43,443 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:43,510 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:43,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 21:26:43,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:26:43,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:26:43,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:26:43,511 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-04-11 21:26:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:43,640 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-04-11 21:26:43,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:26:43,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 21:26:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:43,642 INFO L225 Difference]: With dead ends: 126 [2018-04-11 21:26:43,642 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 21:26:43,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:26:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 21:26:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 66. [2018-04-11 21:26:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 21:26:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-04-11 21:26:43,649 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2018-04-11 21:26:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:43,650 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-04-11 21:26:43,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:26:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-04-11 21:26:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:26:43,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:43,651 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:43,651 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash -505999511, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:43,667 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:43,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:43,753 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:43,797 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:43,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 21:26:43,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:26:43,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:26:43,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:26:43,798 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2018-04-11 21:26:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:43,946 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-11 21:26:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:26:43,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 21:26:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:43,948 INFO L225 Difference]: With dead ends: 123 [2018-04-11 21:26:43,948 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 21:26:43,948 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-04-11 21:26:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 21:26:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2018-04-11 21:26:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 21:26:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-11 21:26:43,957 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 22 [2018-04-11 21:26:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:43,958 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-11 21:26:43,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:26:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-11 21:26:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:26:43,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:43,959 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:43,959 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash -505998677, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:43,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:43,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:44,007 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:44,032 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:44,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:26:44,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:26:44,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:26:44,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:26:44,033 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 4 states. [2018-04-11 21:26:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:44,112 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-04-11 21:26:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:26:44,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-11 21:26:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:44,113 INFO L225 Difference]: With dead ends: 88 [2018-04-11 21:26:44,113 INFO L226 Difference]: Without dead ends: 85 [2018-04-11 21:26:44,113 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:26:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-11 21:26:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-04-11 21:26:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 21:26:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-04-11 21:26:44,119 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 22 [2018-04-11 21:26:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:44,119 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-04-11 21:26:44,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:26:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-04-11 21:26:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:26:44,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:44,120 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:44,120 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash -505998676, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:44,130 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:44,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:44,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:44,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:26:44,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-04-11 21:26:44,184 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:44,248 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:44,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 8 [2018-04-11 21:26:44,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:26:44,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:26:44,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:26:44,249 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 9 states. [2018-04-11 21:26:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:44,503 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-04-11 21:26:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:26:44,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-11 21:26:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:44,504 INFO L225 Difference]: With dead ends: 248 [2018-04-11 21:26:44,504 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 21:26:44,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:26:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 21:26:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 107. [2018-04-11 21:26:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 21:26:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-04-11 21:26:44,512 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 22 [2018-04-11 21:26:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:44,512 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-04-11 21:26:44,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:26:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-04-11 21:26:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 21:26:44,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:44,513 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:44,513 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:44,513 INFO L82 PathProgramCache]: Analyzing trace with hash 469306275, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:44,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:44,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:44,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:44,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:26:44,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:44,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:44,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:26:44,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:44,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 21:26:44,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:44,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 21:26:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:44,606 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:44,664 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:26:44,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,674 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:26:44,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:26:44,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-11 21:26:44,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:44,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:44,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-04-11 21:26:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:44,741 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:44,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-11 21:26:44,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:26:44,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:26:44,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:26:44,742 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 10 states. [2018-04-11 21:26:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:44,973 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-04-11 21:26:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:26:44,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-04-11 21:26:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:44,974 INFO L225 Difference]: With dead ends: 153 [2018-04-11 21:26:44,975 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 21:26:44,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:26:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 21:26:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2018-04-11 21:26:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 21:26:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-04-11 21:26:44,984 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 27 [2018-04-11 21:26:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:44,984 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-04-11 21:26:44,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:26:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-04-11 21:26:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 21:26:44,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:44,985 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:44,986 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1445383902, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:44,992 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:45,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:45,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:26:45,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 10 treesize of output 9 [2018-04-11 21:26:45,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 21:26:45,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:26:45,039 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-11 21:26:45,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 21:26:45,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 21:26:45,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 21:26:45,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-11 21:26:45,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:12 [2018-04-11 21:26:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:45,098 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:45,179 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:45,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-04-11 21:26:45,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 21:26:45,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 21:26:45,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-11 21:26:45,180 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 13 states. [2018-04-11 21:26:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:45,618 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-04-11 21:26:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 21:26:45,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-11 21:26:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:45,619 INFO L225 Difference]: With dead ends: 167 [2018-04-11 21:26:45,619 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 21:26:45,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-04-11 21:26:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 21:26:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2018-04-11 21:26:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 21:26:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-04-11 21:26:45,628 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 29 [2018-04-11 21:26:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:45,628 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-04-11 21:26:45,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 21:26:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-04-11 21:26:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 21:26:45,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:45,630 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:45,630 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1061088070, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:45,636 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:45,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:45,702 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))) is different from true [2018-04-11 21:26:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 21:26:45,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:45,728 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_7| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc0.base_7| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))))) is different from false [2018-04-11 21:26:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:45,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:26:45,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 21:26:45,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 21:26:45,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 21:26:45,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2018-04-11 21:26:45,755 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 11 states. [2018-04-11 21:26:45,763 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc0.base_7| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc0.base_7| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-11 21:26:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:45,936 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2018-04-11 21:26:45,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:26:45,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-11 21:26:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:45,937 INFO L225 Difference]: With dead ends: 131 [2018-04-11 21:26:45,937 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 21:26:45,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=134, Unknown=3, NotChecked=78, Total=272 [2018-04-11 21:26:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 21:26:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-04-11 21:26:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 21:26:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-04-11 21:26:45,944 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 34 [2018-04-11 21:26:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:45,944 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-04-11 21:26:45,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 21:26:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-04-11 21:26:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 21:26:45,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:45,945 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:45,946 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1061088904, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:45,957 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:45,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:45,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 11 treesize of output 8 [2018-04-11 21:26:45,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:45,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:45,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:26:46,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:46,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-11 21:26:46,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:26:46,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:26:46,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:26:46,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:26:46,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-04-11 21:26:46,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 21:26:46,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:26:46,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-11 21:26:46,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-04-11 21:26:46,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-04-11 21:26:46,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-11 21:26:46,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-04-11 21:26:46,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,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 29 treesize of output 21 [2018-04-11 21:26:46,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:46,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2018-04-11 21:26:46,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2018-04-11 21:26:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:46,308 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:46,363 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:26:46,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:1 [2018-04-11 21:26:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:46,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:26:46,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2018-04-11 21:26:46,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 21:26:46,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 21:26:46,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-11 21:26:46,389 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 13 states. [2018-04-11 21:26:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:46,684 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2018-04-11 21:26:46,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:26:46,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-04-11 21:26:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:46,685 INFO L225 Difference]: With dead ends: 137 [2018-04-11 21:26:46,686 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 21:26:46,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-04-11 21:26:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 21:26:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-04-11 21:26:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-11 21:26:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-04-11 21:26:46,692 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 34 [2018-04-11 21:26:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:46,692 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-04-11 21:26:46,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 21:26:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-04-11 21:26:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:26:46,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:46,693 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:46,693 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash -651749331, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:46,702 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:46,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:46,737 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:46,763 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:46,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 21:26:46,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:26:46,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:26:46,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:26:46,764 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 5 states. [2018-04-11 21:26:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:46,827 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-04-11 21:26:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:26:46,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-11 21:26:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:46,828 INFO L225 Difference]: With dead ends: 127 [2018-04-11 21:26:46,828 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 21:26:46,829 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:26:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 21:26:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2018-04-11 21:26:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-11 21:26:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-04-11 21:26:46,836 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 35 [2018-04-11 21:26:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:46,837 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-04-11 21:26:46,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:26:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-04-11 21:26:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:26:46,838 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:46,838 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:46,838 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash -564018963, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:46,845 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:46,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:46,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:46,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:26:46,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:26:46,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:46,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-11 21:26:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:46,990 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:47,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:26:47,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-04-11 21:26:47,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 21:26:47,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 21:26:47,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-04-11 21:26:47,380 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 12 states. [2018-04-11 21:26:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:47,610 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-04-11 21:26:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:26:47,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-04-11 21:26:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:47,611 INFO L225 Difference]: With dead ends: 147 [2018-04-11 21:26:47,611 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 21:26:47,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=186, Unknown=1, NotChecked=0, Total=272 [2018-04-11 21:26:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 21:26:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 93. [2018-04-11 21:26:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 21:26:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-11 21:26:47,617 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 35 [2018-04-11 21:26:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:47,617 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-11 21:26:47,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 21:26:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-11 21:26:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 21:26:47,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:47,618 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:47,618 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash 842485185, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:47,627 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:47,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:47,662 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:47,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-11 21:26:47,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:10 [2018-04-11 21:26:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:47,721 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:47,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-11 21:26:47,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:26:47,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:26:47,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:26:47,722 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 9 states. [2018-04-11 21:26:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:47,871 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-04-11 21:26:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:26:47,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-11 21:26:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:47,872 INFO L225 Difference]: With dead ends: 130 [2018-04-11 21:26:47,872 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 21:26:47,873 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:26:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 21:26:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2018-04-11 21:26:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 21:26:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-04-11 21:26:47,880 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 36 [2018-04-11 21:26:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:47,880 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-04-11 21:26:47,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:26:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-04-11 21:26:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 21:26:47,881 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:47,881 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:47,881 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1740028819, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:47,887 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:47,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:47,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:26:47,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:26:47,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 21:26:47,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 21:26:47,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:26:47,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:47,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-11 21:26:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:47,974 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:48,040 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:48,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-04-11 21:26:48,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 21:26:48,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 21:26:48,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 21:26:48,041 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 14 states. [2018-04-11 21:26:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:48,291 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-04-11 21:26:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 21:26:48,292 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-04-11 21:26:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:48,292 INFO L225 Difference]: With dead ends: 182 [2018-04-11 21:26:48,293 INFO L226 Difference]: Without dead ends: 181 [2018-04-11 21:26:48,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:26:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-11 21:26:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 95. [2018-04-11 21:26:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 21:26:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-04-11 21:26:48,300 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 43 [2018-04-11 21:26:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:48,300 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-04-11 21:26:48,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 21:26:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-04-11 21:26:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 21:26:48,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:48,301 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:48,301 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1893681575, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:48,308 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:48,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:48,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:48,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:26:48,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:26:48,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:26:48,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-11 21:26:48,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 21:26:48,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 21:26:48,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-04-11 21:26:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:48,401 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:48,481 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:48,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-04-11 21:26:48,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 21:26:48,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 21:26:48,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 21:26:48,482 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 14 states. [2018-04-11 21:26:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:48,854 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-04-11 21:26:48,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 21:26:48,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-04-11 21:26:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:48,855 INFO L225 Difference]: With dead ends: 149 [2018-04-11 21:26:48,855 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 21:26:48,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-04-11 21:26:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 21:26:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2018-04-11 21:26:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 21:26:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-04-11 21:26:48,860 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 44 [2018-04-11 21:26:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:48,861 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-04-11 21:26:48,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 21:26:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-04-11 21:26:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:26:48,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:48,861 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:48,861 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1930685962, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:48,868 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:48,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:48,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:48,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:48,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:26:48,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-04-11 21:26:48,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:26:48,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:48,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-04-11 21:26:48,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-11 21:26:48,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:26:48,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:48,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 21:26:48,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-11 21:26:48,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:48,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-04-11 21:26:48,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:48,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:49,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-11 21:26:49,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-04-11 21:26:49,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-04-11 21:26:49,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:26:49,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,055 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2018-04-11 21:26:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:49,076 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:49,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 21:26:49,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:26:49,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 21:26:49,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-04-11 21:26:49,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2018-04-11 21:26:49,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:26:49,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:26:49,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-11 21:26:49,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:49,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-04-11 21:26:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:49,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:26:49,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-04-11 21:26:49,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 21:26:49,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 21:26:49,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-04-11 21:26:49,258 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 21 states. [2018-04-11 21:26:50,730 WARN L148 SmtUtils]: Spent 793ms on a formula simplification that was a NOOP. DAG size: 22 [2018-04-11 21:26:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:50,887 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-04-11 21:26:50,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 21:26:50,887 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-04-11 21:26:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:50,888 INFO L225 Difference]: With dead ends: 199 [2018-04-11 21:26:50,889 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 21:26:50,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=409, Invalid=1661, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 21:26:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 21:26:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 147. [2018-04-11 21:26:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 21:26:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-04-11 21:26:50,901 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 47 [2018-04-11 21:26:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:50,901 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-04-11 21:26:50,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 21:26:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-04-11 21:26:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:26:50,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:50,902 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:50,902 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1930686796, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:50,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:50,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:50,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:50,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:50,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:26:50,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:50,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:50,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 21:26:50,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:26:50,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:50,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:50,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:50,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:50,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-04-11 21:26:50,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 21:26:50,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:26:50,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:50,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:50,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:50,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 21:26:51,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-04-11 21:26:51,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:51,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-04-11 21:26:51,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:51,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-11 21:26:51,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-04-11 21:26:51,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-04-11 21:26:51,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:26:51,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,088 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:10 [2018-04-11 21:26:51,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:51,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 21:26:51,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:51,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 21:26:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:51,136 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:51,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 25 treesize of output 18 [2018-04-11 21:26:51,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-11 21:26:51,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 21:26:51,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2018-04-11 21:26:51,835 WARN L148 SmtUtils]: Spent 599ms on a formula simplification that was a NOOP. DAG size: 24 [2018-04-11 21:26:51,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-11 21:26:51,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:26:51,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 21:26:51,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-04-11 21:26:51,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:51,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:8 [2018-04-11 21:26:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:51,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:26:51,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-04-11 21:26:51,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:26:51,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:26:51,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:26:51,966 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 22 states. [2018-04-11 21:26:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:53,037 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-04-11 21:26:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 21:26:53,038 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-04-11 21:26:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:53,038 INFO L225 Difference]: With dead ends: 207 [2018-04-11 21:26:53,038 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 21:26:53,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 21:26:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 21:26:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2018-04-11 21:26:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 21:26:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2018-04-11 21:26:53,050 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 47 [2018-04-11 21:26:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:53,050 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2018-04-11 21:26:53,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:26:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2018-04-11 21:26:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:26:53,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:53,051 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:53,051 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1930686797, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:53,058 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:53,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:53,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:53,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:53,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:26:53,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 21:26:53,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:26:53,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:53,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:26:53,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:53,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 21:26:53,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 21:26:53,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:26:53,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-11 21:26:53,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:26:53,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2018-04-11 21:26:53,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-04-11 21:26:53,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:53,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:53,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-04-11 21:26:53,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-11 21:26:53,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:53,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2018-04-11 21:26:53,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-04-11 21:26:53,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-04-11 21:26:53,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:26:53,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-04-11 21:26:53,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-11 21:26:53,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:53,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-11 21:26:53,328 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,331 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,335 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2018-04-11 21:26:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:53,364 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:53,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-11 21:26:53,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:53,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2018-04-11 21:26:53,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:26:53,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:26:53,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-11 21:26:54,040 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:26:54,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:54,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 21:26:54,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:26:54,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:54,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 21:26:54,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-11 21:26:54,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:54,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:54,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:26:54,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:26:54,174 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:132, output treesize:35 [2018-04-11 21:26:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:54,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:26:54,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-04-11 21:26:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 21:26:54,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 21:26:54,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-11 21:26:54,364 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 25 states. [2018-04-11 21:26:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:56,083 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2018-04-11 21:26:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 21:26:56,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-04-11 21:26:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:56,084 INFO L225 Difference]: With dead ends: 256 [2018-04-11 21:26:56,084 INFO L226 Difference]: Without dead ends: 254 [2018-04-11 21:26:56,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1039, Invalid=2867, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 21:26:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-11 21:26:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 192. [2018-04-11 21:26:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 21:26:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2018-04-11 21:26:56,097 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 47 [2018-04-11 21:26:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:56,098 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2018-04-11 21:26:56,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 21:26:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2018-04-11 21:26:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:26:56,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:56,099 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:56,099 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash -142927862, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:56,105 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:56,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:56,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:56,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:56,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:26:56,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 21:26:56,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:26:56,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:26:56,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-11 21:26:56,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 21:26:56,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 21:26:56,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-04-11 21:26:56,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:56,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 21:26:56,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:56,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 21:26:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:56,231 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:56,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:26:56,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-04-11 21:26:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:56,337 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:26:56,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2018-04-11 21:26:56,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 21:26:56,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 21:26:56,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-04-11 21:26:56,338 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand 20 states. [2018-04-11 21:26:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:26:56,778 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2018-04-11 21:26:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:26:56,778 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-04-11 21:26:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:26:56,779 INFO L225 Difference]: With dead ends: 211 [2018-04-11 21:26:56,779 INFO L226 Difference]: Without dead ends: 210 [2018-04-11 21:26:56,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 21:26:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-11 21:26:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2018-04-11 21:26:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 21:26:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-04-11 21:26:56,786 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 48 [2018-04-11 21:26:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:26:56,786 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-04-11 21:26:56,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 21:26:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-04-11 21:26:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:26:56,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:26:56,787 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:26:56,787 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:26:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1111647649, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:26:56,793 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:26:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:26:56,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:26:56,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:26:56,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:26:56,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:56,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:56,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:26:56,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 21:26:56,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 21:26:56,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:26:56,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:56,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:26:56,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:26:56,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:35 [2018-04-11 21:26:56,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 21:26:56,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:26:56,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-11 21:26:56,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:26:56,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-04-11 21:26:56,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-04-11 21:26:56,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:56,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:56,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-04-11 21:26:56,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:56,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-11 21:26:57,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:57,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2018-04-11 21:26:57,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-11 21:26:57,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-04-11 21:26:57,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:26:57,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-04-11 21:26:57,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-11 21:26:57,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:26:57,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-11 21:26:57,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:57,108 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-04-11 21:26:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:57,188 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:26:57,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-11 21:26:57,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:26:57,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-04-11 21:26:57,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-11 21:26:57,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-04-11 21:26:57,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:26:57,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-11 21:26:57,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:26:57,396 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,399 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-04-11 21:26:57,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-04-11 21:26:57,402 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,405 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,414 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:26:57,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:26:57,427 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:105, output treesize:38 [2018-04-11 21:26:57,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:26:57,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:26:57,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-11 21:26:57,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:26:57,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:26:57,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-04-11 21:26:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:26:57,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:26:57,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-04-11 21:26:57,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 21:26:57,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 21:26:57,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-04-11 21:26:57,608 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 29 states. [2018-04-11 21:26:58,584 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 110 DAG size of output 83 [2018-04-11 21:27:23,990 WARN L151 SmtUtils]: Spent 24132ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-04-11 21:27:24,317 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 105 DAG size of output 78 [2018-04-11 21:27:24,911 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-04-11 21:27:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:27:25,512 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2018-04-11 21:27:25,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 21:27:25,512 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-04-11 21:27:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:27:25,513 INFO L225 Difference]: With dead ends: 325 [2018-04-11 21:27:25,513 INFO L226 Difference]: Without dead ends: 324 [2018-04-11 21:27:25,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=1788, Invalid=5018, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 21:27:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-04-11 21:27:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 195. [2018-04-11 21:27:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 21:27:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-04-11 21:27:25,523 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 50 [2018-04-11 21:27:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:27:25,523 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-04-11 21:27:25,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 21:27:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-04-11 21:27:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:27:25,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:27:25,524 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:27:25,524 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:27:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1980996322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:27:25,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:27:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:27:25,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:27:25,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:25,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:25,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:27:25,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 21:27:25,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:27:25,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:27:25,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-04-11 21:27:25,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 21:27:25,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:27:25,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:27:25,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 21:27:25,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:25,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:25,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-11 21:27:25,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:27:25,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:47 [2018-04-11 21:27:25,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-04-11 21:27:25,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:25,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-04-11 21:27:25,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:27:25,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:59 [2018-04-11 21:27:25,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2018-04-11 21:27:25,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2018-04-11 21:27:25,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:27:25,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:19 [2018-04-11 21:27:25,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:25,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-11 21:27:25,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:25,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:27:25,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-04-11 21:27:25,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:26,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:26,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-04-11 21:27:26,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:26,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:27:26,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 21:27:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:27:26,123 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:27:26,269 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:26,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:26,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-04-11 21:27:26,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:26,289 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:26,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-11 21:27:26,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:26,292 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:26,293 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:26,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 [2018-04-11 21:27:26,300 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 21:27:26,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:27:26,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 21:27:26,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:60 [2018-04-11 21:27:27,543 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:27:27,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-11 21:27:27,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:27:27,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:27,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-04-11 21:27:27,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 21:27:27,569 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 21:27:27,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-04-11 21:27:27,586 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,587 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:27,592 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:100, output treesize:8 [2018-04-11 21:27:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:27:27,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:27:27,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-04-11 21:27:27,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 21:27:27,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 21:27:27,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-04-11 21:27:27,682 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 31 states. [2018-04-11 21:27:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:27:29,286 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-04-11 21:27:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 21:27:29,286 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-04-11 21:27:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:27:29,287 INFO L225 Difference]: With dead ends: 208 [2018-04-11 21:27:29,287 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 21:27:29,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=698, Invalid=2842, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 21:27:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 21:27:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2018-04-11 21:27:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 21:27:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-04-11 21:27:29,299 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 53 [2018-04-11 21:27:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:27:29,299 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-04-11 21:27:29,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 21:27:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-04-11 21:27:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:27:29,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:27:29,300 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:27:29,301 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:27:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 379833185, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:27:29,309 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:27:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:27:29,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:27:29,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:27:29,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:27:29,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 21:27:29,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:27:29,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-11 21:27:29,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:27:29,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-04-11 21:27:29,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 21:27:29,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:27:29,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 21:27:29,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:27:29,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-04-11 21:27:29,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-04-11 21:27:29,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 39 [2018-04-11 21:27:29,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-04-11 21:27:29,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-04-11 21:27:29,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:67 [2018-04-11 21:27:29,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-04-11 21:27:29,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 84 [2018-04-11 21:27:29,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-04-11 21:27:29,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-04-11 21:27:29,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-04-11 21:27:29,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2018-04-11 21:27:29,789 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:29,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,800 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 39 [2018-04-11 21:27:29,801 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 21:27:29,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-04-11 21:27:29,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-11 21:27:29,841 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:27:29,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-11 21:27:29,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:27:29,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:27:29,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:29,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:110, output treesize:12 [2018-04-11 21:27:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:27:29,888 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:27:30,976 WARN L148 SmtUtils]: Spent 216ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-11 21:27:32,078 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:27:32,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:27:32,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:27:32,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:961, output treesize:1 [2018-04-11 21:27:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:27:32,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:27:32,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2018-04-11 21:27:32,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 21:27:32,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 21:27:32,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-04-11 21:27:32,119 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 31 states. [2018-04-11 21:27:34,044 WARN L151 SmtUtils]: Spent 1109ms on a formula simplification. DAG size of input: 155 DAG size of output 131 [2018-04-11 21:27:34,413 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 106 DAG size of output 98 [2018-04-11 21:27:34,952 WARN L151 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 124 DAG size of output 104 [2018-04-11 21:27:37,077 WARN L151 SmtUtils]: Spent 1541ms on a formula simplification. DAG size of input: 161 DAG size of output 135 [2018-04-11 21:27:37,629 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 148 DAG size of output 109 [2018-04-11 21:27:37,992 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 123 DAG size of output 84 [2018-04-11 21:27:39,059 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 119 DAG size of output 80 [2018-04-11 21:27:39,596 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 99 DAG size of output 87 [2018-04-11 21:27:53,432 WARN L151 SmtUtils]: Spent 11901ms on a formula simplification. DAG size of input: 128 DAG size of output 122 [2018-04-11 21:27:53,797 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-04-11 21:27:57,670 WARN L151 SmtUtils]: Spent 708ms on a formula simplification. DAG size of input: 131 DAG size of output 119 [2018-04-11 21:27:58,771 WARN L151 SmtUtils]: Spent 769ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-04-11 21:27:59,919 WARN L151 SmtUtils]: Spent 707ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-04-11 21:28:00,171 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 89 DAG size of output 83 [2018-04-11 21:28:00,560 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 90 [2018-04-11 21:28:01,486 WARN L151 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-04-11 21:28:01,928 WARN L151 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-04-11 21:28:47,593 WARN L151 SmtUtils]: Spent 28292ms on a formula simplification. DAG size of input: 154 DAG size of output 148 [2018-04-11 21:28:49,976 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-04-11 21:28:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:28:50,437 INFO L93 Difference]: Finished difference Result 374 states and 403 transitions. [2018-04-11 21:28:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 21:28:50,438 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-04-11 21:28:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:28:50,439 INFO L225 Difference]: With dead ends: 374 [2018-04-11 21:28:50,440 INFO L226 Difference]: Without dead ends: 336 [2018-04-11 21:28:50,442 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2044 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=1217, Invalid=6259, Unknown=6, NotChecked=0, Total=7482 [2018-04-11 21:28:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-11 21:28:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 261. [2018-04-11 21:28:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 21:28:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 284 transitions. [2018-04-11 21:28:50,460 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 284 transitions. Word has length 54 [2018-04-11 21:28:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:28:50,460 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 284 transitions. [2018-04-11 21:28:50,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 21:28:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 284 transitions. [2018-04-11 21:28:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:28:50,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:28:50,462 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:28:50,462 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:28:50,462 INFO L82 PathProgramCache]: Analyzing trace with hash -496997936, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:28:50,470 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:28:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:28:50,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:28:50,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:50,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:50,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:28:50,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 21:28:50,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:28:50,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:28:50,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-04-11 21:28:50,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 21:28:50,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:28:50,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:28:50,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 21:28:50,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 21:28:50,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:50,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:28:50,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:28:50,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-04-11 21:28:50,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 21:28:50,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:28:50,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-04-11 21:28:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:28:50,789 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:28:50,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 21:28:50,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:28:50,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-11 21:28:50,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 6 treesize of output 1 [2018-04-11 21:28:50,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 21:28:50,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-11 21:28:50,870 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:50,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:28:50,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:28:50,898 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:38, output treesize:43 [2018-04-11 21:28:51,012 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:28:51,012 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:28:51,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-04-11 21:28:51,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:51,029 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:28:51,029 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:28:51,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-11 21:28:51,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:51,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:28:51,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:13 [2018-04-11 21:28:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:28:51,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:28:51,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-04-11 21:28:51,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 21:28:51,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 21:28:51,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-04-11 21:28:51,065 INFO L87 Difference]: Start difference. First operand 261 states and 284 transitions. Second operand 20 states. [2018-04-11 21:28:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:28:51,860 INFO L93 Difference]: Finished difference Result 297 states and 321 transitions. [2018-04-11 21:28:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 21:28:51,860 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-11 21:28:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:28:51,863 INFO L225 Difference]: With dead ends: 297 [2018-04-11 21:28:51,864 INFO L226 Difference]: Without dead ends: 296 [2018-04-11 21:28:51,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=477, Invalid=1163, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 21:28:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-11 21:28:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 232. [2018-04-11 21:28:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-11 21:28:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2018-04-11 21:28:51,877 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 54 [2018-04-11 21:28:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:28:51,877 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2018-04-11 21:28:51,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 21:28:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2018-04-11 21:28:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 21:28:51,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:28:51,878 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:28:51,878 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:28:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1988485223, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:28:51,884 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:28:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:28:51,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:28:51,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:28:51,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:28:51,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:51,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:51,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:51,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-04-11 21:28:51,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:51,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-04-11 21:28:51,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:28:51,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:51,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:51,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:28:51,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 21:28:52,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:52,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-04-11 21:28:52,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:52,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-04-11 21:28:52,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:28:52,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-04-11 21:28:52,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:52,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-04-11 21:28:52,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:28:52,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:52,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-04-11 21:28:52,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,141 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:23 [2018-04-11 21:28:52,229 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_subst_4 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~0.base 1))) (and (= (select |c_old(#valid)| main_~y~0.base) 0) (= (store (store .cse0 v_subst_4 0) main_~y~0.base 0) |c_#valid|) (= (select .cse0 v_subst_4) 0)))) is different from true [2018-04-11 21:28:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-04-11 21:28:52,242 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:28:52,408 WARN L1011 $PredicateComparison]: unable to prove that (forall ((main_~list~0.offset Int)) (= |c_old(#valid)| (store (store |c_#valid| c_main_~y~0.base 0) (select (select (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) (+ main_~list~0.offset 4) c_main_~y~0.base)) c_main_~y~0.base) c_main_~y~0.offset) 0))) is different from false [2018-04-11 21:28:52,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-11 21:28:52,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:28:52,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 21:28:52,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-11 21:28:52,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:52,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14 [2018-04-11 21:28:52,483 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc2.base_16|))) (= (store (store |c_#valid| |v_main_#t~malloc2.base_16| 0) c_main_~list~0.base 0) |c_old(#valid)|))) is different from false [2018-04-11 21:28:52,498 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc2.base_16|))) (= (store (store |c_#valid| |v_main_#t~malloc2.base_16| 0) c_main_~y~0.base 0) |c_old(#valid)|))) is different from false [2018-04-11 21:28:52,567 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int) (|v_main_#t~malloc0.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc0.base_12|) 0)) (= (store (store .cse0 |v_main_#t~malloc2.base_16| 0) |v_main_#t~malloc0.base_12| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc2.base_16|)))))) is different from false [2018-04-11 21:28:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-11 21:28:52,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:28:52,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-11 21:28:52,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 21:28:52,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 21:28:52,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=665, Unknown=18, NotChecked=280, Total=1056 [2018-04-11 21:28:52,602 INFO L87 Difference]: Start difference. First operand 232 states and 253 transitions. Second operand 33 states. [2018-04-11 21:28:52,627 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc2.base_16| Int) (|v_main_#t~malloc0.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc0.base_12|) 0)) (= (store (store .cse0 |v_main_#t~malloc2.base_16| 0) |v_main_#t~malloc0.base_12| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc2.base_16|))))))) is different from false [2018-04-11 21:28:52,816 WARN L1011 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_old(#valid)| c_main_~list~0.base 1))) (and (= c_main_~list~0.base (select (select |c_#memory_$Pointer$.base| c_main_~y~0.base) c_main_~y~0.offset)) (forall ((main_~list~0.offset Int)) (= |c_old(#valid)| (store (store |c_#valid| c_main_~y~0.base 0) (select (select (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) (+ main_~list~0.offset 4) c_main_~y~0.base)) c_main_~y~0.base) c_main_~y~0.offset) 0))) (= c_main_~y~0.offset 0) (= (select .cse0 |c_main_#t~malloc2.base|) 0) (= |c_#valid| (store .cse0 c_main_~y~0.base 1)) (= 0 |c_main_#t~malloc2.offset|) (= |c_#valid| (store .cse0 |c_main_#t~malloc2.base| 1)) (= (select .cse0 c_main_~y~0.base) 0) (= (select |c_old(#valid)| c_main_~list~0.base) 0))) is different from false [2018-04-11 21:28:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:28:53,544 INFO L93 Difference]: Finished difference Result 277 states and 299 transitions. [2018-04-11 21:28:53,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 21:28:53,544 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-04-11 21:28:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:28:53,545 INFO L225 Difference]: With dead ends: 277 [2018-04-11 21:28:53,545 INFO L226 Difference]: Without dead ends: 274 [2018-04-11 21:28:53,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1357, Unknown=26, NotChecked=574, Total=2162 [2018-04-11 21:28:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-11 21:28:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2018-04-11 21:28:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-11 21:28:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2018-04-11 21:28:53,565 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 59 [2018-04-11 21:28:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:28:53,565 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2018-04-11 21:28:53,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 21:28:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2018-04-11 21:28:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 21:28:53,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:28:53,566 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:28:53,566 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:28:53,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1988486057, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:28:53,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:28:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:28:53,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:28:53,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:28:53,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:28:53,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:28:53,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:28:53,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 21:28:53,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:28:53,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:28:53,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:28:53,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:28:53,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 21:28:53,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 32 treesize of output 25 [2018-04-11 21:28:53,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 60 [2018-04-11 21:28:53,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 21:28:53,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:28:53,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-04-11 21:28:53,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:28:53,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-04-11 21:28:53,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 21:28:53,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:28:53,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 21:28:53,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:28:53,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:67 [2018-04-11 21:28:53,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 95 [2018-04-11 21:28:53,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-04-11 21:28:53,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,968 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:28:53,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-04-11 21:28:53,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:53,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-04-11 21:28:53,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:53,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-04-11 21:28:54,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-11 21:28:54,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-04-11 21:28:54,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2018-04-11 21:28:54,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 106 [2018-04-11 21:28:54,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:109 [2018-04-11 21:28:54,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 87 [2018-04-11 21:28:54,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,213 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 77 [2018-04-11 21:28:54,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-11 21:28:54,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-04-11 21:28:54,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:28:54,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:28:54,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-04-11 21:28:54,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-04-11 21:28:54,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:28:54,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 21:28:54,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:28:54,285 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:7 [2018-04-11 21:28:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:28:54,332 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:29:24,538 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:29:24,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:29:24,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:29:24,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:951, output treesize:1 [2018-04-11 21:29:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:29:24,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:29:24,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2018-04-11 21:29:24,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 21:29:24,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 21:29:24,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=668, Unknown=1, NotChecked=0, Total=756 [2018-04-11 21:29:24,580 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 28 states. [2018-04-11 21:30:08,778 WARN L151 SmtUtils]: Spent 39253ms on a formula simplification. DAG size of input: 192 DAG size of output 184 Received shutdown request... [2018-04-11 21:31:14,327 WARN L151 SmtUtils]: Spent 52323ms on a formula simplification. DAG size of input: 196 DAG size of output 186 [2018-04-11 21:31:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:31:14,328 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 21:31:14,333 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 21:31:14,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 09:31:14 BoogieIcfgContainer [2018-04-11 21:31:14,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 21:31:14,334 INFO L168 Benchmark]: Toolchain (without parser) took 273057.07 ms. Allocated memory was 305.1 MB in the beginning and 634.4 MB in the end (delta: 329.3 MB). Free memory was 241.3 MB in the beginning and 546.7 MB in the end (delta: -305.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 21:31:14,335 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.1 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 21:31:14,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.87 ms. Allocated memory is still 305.1 MB. Free memory was 241.3 MB in the beginning and 217.2 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-11 21:31:14,335 INFO L168 Benchmark]: Boogie Preprocessor took 61.83 ms. Allocated memory is still 305.1 MB. Free memory was 217.2 MB in the beginning and 214.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-11 21:31:14,336 INFO L168 Benchmark]: RCFGBuilder took 524.63 ms. Allocated memory was 305.1 MB in the beginning and 468.2 MB in the end (delta: 163.1 MB). Free memory was 214.2 MB in the beginning and 402.4 MB in the end (delta: -188.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. [2018-04-11 21:31:14,336 INFO L168 Benchmark]: TraceAbstraction took 272144.94 ms. Allocated memory was 468.2 MB in the beginning and 634.4 MB in the end (delta: 166.2 MB). Free memory was 402.4 MB in the beginning and 546.7 MB in the end (delta: -144.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. [2018-04-11 21:31:14,337 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.20 ms. Allocated memory is still 305.1 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 320.87 ms. Allocated memory is still 305.1 MB. Free memory was 241.3 MB in the beginning and 217.2 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 61.83 ms. Allocated memory is still 305.1 MB. Free memory was 217.2 MB in the beginning and 214.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 524.63 ms. Allocated memory was 305.1 MB in the beginning and 468.2 MB in the end (delta: 163.1 MB). Free memory was 214.2 MB in the beginning and 402.4 MB in the end (delta: -188.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 272144.94 ms. Allocated memory was 468.2 MB in the beginning and 634.4 MB in the end (delta: 166.2 MB). Free memory was 402.4 MB in the beginning and 546.7 MB in the end (delta: -144.3 MB). Peak memory consumption was 21.9 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 constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (250states) and interpolant automaton (currently 15 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 25 error locations. TIMEOUT Result, 272.0s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 227.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1471 SDtfs, 6943 SDslu, 8777 SDs, 0 SdLazy, 7884 SolverSat, 1520 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2311 GetRequests, 1554 SyntacticMatches, 25 SemanticMatches, 732 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 8103 ImplicationChecksByTransitivity, 246.5s 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, 42.8s InterpolantComputationTime, 965 NumberOfCodeBlocks, 965 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1878 ConstructedInterpolants, 243 QuantifiedInterpolants, 1740396 SizeOfPredicates, 277 NumberOfNonLiveVariables, 3487 ConjunctsInSsa, 580 ConjunctsInUnsatCore, 52 InterpolantComputations, 28 PerfectInterpolantSequences, 52/262 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_21-31-14-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_21-31-14-346.csv Completed graceful shutdown