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/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 16:37:42,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 16:37:42,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 16:37:42,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 16:37:42,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 16:37:42,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 16:37:42,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 16:37:42,463 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 16:37:42,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 16:37:42,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 16:37:42,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 16:37:42,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 16:37:42,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 16:37:42,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 16:37:42,489 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 16:37:42,491 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 16:37:42,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 16:37:42,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 16:37:42,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 16:37:42,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 16:37:42,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 16:37:42,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 16:37:42,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 16:37:42,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 16:37:42,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 16:37:42,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 16:37:42,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 16:37:42,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 16:37:42,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 16:37:42,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 16:37:42,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 16:37:42,546 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-05 16:37:42,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 16:37:42,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 16:37:42,592 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 16:37:42,592 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 16:37:42,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 16:37:42,593 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 16:37:42,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 16:37:42,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 16:37:42,594 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 16:37:42,597 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 16:37:42,598 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 16:37:42,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 16:37:42,598 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 16:37:42,598 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 16:37:42,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 16:37:42,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 16:37:42,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 16:37:42,599 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 16:37:42,599 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 16:37:42,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 16:37:42,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 16:37:42,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 16:37:42,600 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 16:37:42,600 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 16:37:42,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 16:37:42,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 16:37:42,602 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 16:37:42,602 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 16:37:42,602 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 16:37:42,603 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 16:37:42,603 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 16:37:42,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 16:37:42,603 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 16:37:42,604 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 16:37:42,605 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 16:37:42,605 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 16:37:42,605 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 16:37:42,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 16:37:42,735 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 16:37:42,749 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 16:37:42,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 16:37:42,754 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 16:37:42,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,364 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfe6da45ff [2018-04-05 16:37:43,864 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 16:37:43,870 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 16:37:43,870 INFO L168 CDTParser]: Scanning subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,900 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 16:37:43,900 INFO L215 ultiparseSymbolTable]: [2018-04-05 16:37:43,901 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 16:37:43,901 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,901 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,901 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,901 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ ('') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,901 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 16:37:43,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____intptr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ssize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____timer_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____mode_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_short in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____socklen_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__size_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__off_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____rlim_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____rlim64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__register_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ldiv_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ino_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____time_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_char in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____suseconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____caddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____dev_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____qaddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__lldiv_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__wchar_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blksize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__blksize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__uid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_char in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_long in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__div_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__caddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__mode_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fd_set in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____sigset_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__gid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_short in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ulong in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_long in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ino_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ino64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____pid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____off_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____gid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__clock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____loff_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__suseconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__daddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____clockid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____daddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____clock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____useconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ushort in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____off64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__loff_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____id_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fd_mask in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_int in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__time_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____nlink_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__clockid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__timer_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__dev_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__sigset_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__id_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fd_mask in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsword_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ssize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__nlink_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:43,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__uint in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:44,044 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfe6da45ff [2018-04-05 16:37:44,086 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 16:37:44,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 16:37:44,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 16:37:44,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 16:37:44,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 16:37:44,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:37:44" (1/1) ... [2018-04-05 16:37:44,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564ffdb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:44, skipping insertion in model container [2018-04-05 16:37:44,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:37:44" (1/1) ... [2018-04-05 16:37:44,208 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 16:37:44,387 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 16:37:44,978 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 16:37:45,173 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 16:37:45,185 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-05 16:37:45,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45 WrapperNode [2018-04-05 16:37:45,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 16:37:45,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 16:37:45,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 16:37:45,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 16:37:45,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... [2018-04-05 16:37:45,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... [2018-04-05 16:37:45,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... [2018-04-05 16:37:45,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... [2018-04-05 16:37:45,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... [2018-04-05 16:37:45,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... [2018-04-05 16:37:45,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... [2018-04-05 16:37:45,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 16:37:45,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 16:37:45,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 16:37:45,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 16:37:45,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 16:37:45,810 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 16:37:45,816 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 16:37:45,816 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-05 16:37:45,816 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-05 16:37:45,816 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-04-05 16:37:45,816 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 16:37:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-05 16:37:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-05 16:37:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-05 16:37:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-05 16:37:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-05 16:37:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-05 16:37:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-05 16:37:45,818 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-05 16:37:45,818 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-05 16:37:45,818 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-05 16:37:45,818 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-05 16:37:45,818 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-05 16:37:45,818 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-05 16:37:45,818 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-05 16:37:45,819 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-05 16:37:45,833 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-05 16:37:45,833 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-05 16:37:45,833 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-05 16:37:45,834 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-05 16:37:45,834 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-05 16:37:45,834 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-05 16:37:45,834 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-05 16:37:45,835 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-05 16:37:45,835 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-05 16:37:45,835 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-05 16:37:45,836 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-05 16:37:45,836 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-05 16:37:45,836 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-05 16:37:45,836 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-05 16:37:45,836 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-05 16:37:45,836 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-05 16:37:45,836 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-05 16:37:45,837 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-05 16:37:45,837 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-05 16:37:45,837 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-05 16:37:45,837 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-05 16:37:45,837 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-05 16:37:45,837 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-05 16:37:45,837 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-05 16:37:45,838 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-05 16:37:45,838 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-05 16:37:45,838 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-05 16:37:45,838 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-05 16:37:45,838 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-05 16:37:45,838 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-05 16:37:45,838 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-05 16:37:45,839 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-05 16:37:45,856 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-05 16:37:45,856 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-05 16:37:45,856 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-05 16:37:45,856 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-05 16:37:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-05 16:37:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 16:37:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-05 16:37:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-05 16:37:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 16:37:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-05 16:37:45,857 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-05 16:37:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-05 16:37:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-05 16:37:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-05 16:37:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-05 16:37:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-05 16:37:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-05 16:37:45,858 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-05 16:37:45,859 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-05 16:37:45,859 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-05 16:37:45,859 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-05 16:37:45,859 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-05 16:37:45,859 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-05 16:37:45,864 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-05 16:37:45,864 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-05 16:37:45,864 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-05 16:37:45,864 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-05 16:37:45,864 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-05 16:37:45,865 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-05 16:37:45,865 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-05 16:37:45,865 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-05 16:37:45,865 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-05 16:37:45,865 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-05 16:37:45,865 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-05 16:37:45,865 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-05 16:37:45,866 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-05 16:37:45,866 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-05 16:37:45,866 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-05 16:37:45,866 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-05 16:37:45,866 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-05 16:37:45,866 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-05 16:37:45,866 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-05 16:37:45,867 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-05 16:37:45,868 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-05 16:37:45,872 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-05 16:37:45,872 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-05 16:37:45,872 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-05 16:37:45,872 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-05 16:37:45,872 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-05 16:37:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-04-05 16:37:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 16:37:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 16:37:45,873 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 16:37:45,874 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 16:37:45,874 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 16:37:45,875 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 16:37:45,875 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 16:37:45,875 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 16:37:47,063 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 16:37:47,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:37:47 BoogieIcfgContainer [2018-04-05 16:37:47,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 16:37:47,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 16:37:47,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 16:37:47,074 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 16:37:47,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 04:37:44" (1/3) ... [2018-04-05 16:37:47,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abba100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:37:47, skipping insertion in model container [2018-04-05 16:37:47,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:37:45" (2/3) ... [2018-04-05 16:37:47,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abba100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:37:47, skipping insertion in model container [2018-04-05 16:37:47,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:37:47" (3/3) ... [2018-04-05 16:37:47,079 INFO L107 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-05 16:37:47,093 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 16:37:47,112 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-05 16:37:47,253 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 16:37:47,254 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 16:37:47,254 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 16:37:47,254 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 16:37:47,254 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 16:37:47,254 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 16:37:47,255 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 16:37:47,255 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 16:37:47,255 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 16:37:47,256 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 16:37:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-04-05 16:37:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-05 16:37:47,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:47,312 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:47,312 INFO L408 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1217463340, 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-05 16:37:47,369 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:47,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:47,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:37:47,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:47,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:37:47,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 16:37:47,743 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-05 16:37:47,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:47,766 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-05 16:37:47,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-05 16:37:47,831 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-05 16:37:47,832 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:47,918 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-05 16:37:48,016 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:48,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 16:37:48,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 16:37:48,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 16:37:48,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 16:37:48,058 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2018-04-05 16:37:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:48,471 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-04-05 16:37:48,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 16:37:48,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-05 16:37:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:48,493 INFO L225 Difference]: With dead ends: 109 [2018-04-05 16:37:48,493 INFO L226 Difference]: Without dead ends: 83 [2018-04-05 16:37:48,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-05 16:37:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-05 16:37:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-05 16:37:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-05 16:37:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-05 16:37:48,570 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 19 [2018-04-05 16:37:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:48,570 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-05 16:37:48,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 16:37:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-05 16:37:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-05 16:37:48,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:48,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:48,573 INFO L408 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1217463341, 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-05 16:37:48,608 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:48,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:48,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-05 16:37:48,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:48,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-05 16:37:48,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:48,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:37:48,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-05 16:37:48,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:37:48,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:37:48,992 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-05 16:37:48,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:49,067 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-05 16:37:49,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:49,119 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-05 16:37:49,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-05 16:37:49,221 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-05 16:37:49,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:51,552 WARN L148 SmtUtils]: Spent 2089ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 16:37:51,603 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:51,603 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-05 16:37:51,623 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-05 16:37:51,667 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:51,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-05 16:37:51,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 16:37:51,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 16:37:51,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-05 16:37:51,670 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 9 states. [2018-04-05 16:37:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:52,354 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-04-05 16:37:52,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 16:37:52,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-05 16:37:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:52,357 INFO L225 Difference]: With dead ends: 83 [2018-04-05 16:37:52,357 INFO L226 Difference]: Without dead ends: 82 [2018-04-05 16:37:52,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-05 16:37:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-05 16:37:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-04-05 16:37:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-05 16:37:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-05 16:37:52,394 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 19 [2018-04-05 16:37:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:52,395 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-05 16:37:52,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 16:37:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-05 16:37:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-05 16:37:52,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:52,396 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:52,397 INFO L408 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:52,399 INFO L82 PathProgramCache]: Analyzing trace with hash -913342120, 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-05 16:37:52,450 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:52,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:52,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:37:52,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:52,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:37:52,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 16:37:52,521 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-05 16:37:52,521 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:52,539 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-05 16:37:52,604 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:52,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 16:37:52,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 16:37:52,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 16:37:52,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 16:37:52,606 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 4 states. [2018-04-05 16:37:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:52,963 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-04-05 16:37:52,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 16:37:52,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-05 16:37:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:52,966 INFO L225 Difference]: With dead ends: 82 [2018-04-05 16:37:52,966 INFO L226 Difference]: Without dead ends: 81 [2018-04-05 16:37:52,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-05 16:37:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-05 16:37:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-05 16:37:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-05 16:37:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-04-05 16:37:52,993 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 20 [2018-04-05 16:37:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:52,994 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-04-05 16:37:52,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 16:37:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-04-05 16:37:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-05 16:37:53,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:53,002 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:53,002 INFO L408 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash -913342119, 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-05 16:37:53,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:53,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:53,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:37:53,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:53,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:37:53,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-05 16:37:53,621 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-05 16:37:53,621 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:53,820 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-05 16:37:53,858 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:53,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-05 16:37:53,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 16:37:53,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 16:37:53,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-05 16:37:53,859 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 7 states. [2018-04-05 16:37:54,128 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 16:37:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:54,359 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-04-05 16:37:54,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 16:37:54,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-05 16:37:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:54,362 INFO L225 Difference]: With dead ends: 81 [2018-04-05 16:37:54,362 INFO L226 Difference]: Without dead ends: 80 [2018-04-05 16:37:54,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-05 16:37:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-05 16:37:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-05 16:37:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-05 16:37:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-04-05 16:37:54,389 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 20 [2018-04-05 16:37:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:54,389 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-04-05 16:37:54,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 16:37:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-04-05 16:37:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-05 16:37:54,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:54,391 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-05 16:37:54,391 INFO L408 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 454780171, 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-05 16:37:54,425 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:54,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:54,581 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-05 16:37:54,582 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 16:37:54,662 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:54,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-05 16:37:54,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 16:37:54,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 16:37:54,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-05 16:37:54,664 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 6 states. [2018-04-05 16:37:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:55,252 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-04-05 16:37:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 16:37:55,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-05 16:37:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:55,254 INFO L225 Difference]: With dead ends: 87 [2018-04-05 16:37:55,254 INFO L226 Difference]: Without dead ends: 85 [2018-04-05 16:37:55,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-05 16:37:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-05 16:37:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-04-05 16:37:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-05 16:37:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-04-05 16:37:55,263 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 27 [2018-04-05 16:37:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:55,264 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-04-05 16:37:55,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 16:37:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-04-05 16:37:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-05 16:37:55,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:55,267 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-05 16:37:55,267 INFO L408 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 454780172, 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-05 16:37:55,293 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:55,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:55,650 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-05 16:37:55,650 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:55,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-05 16:37:55,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:55,730 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 12 treesize of output 10 [2018-04-05 16:37:55,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:55,754 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-05 16:37:55,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-05 16:37:55,836 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-05 16:37:55,888 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:55,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-05 16:37:55,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 16:37:55,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 16:37:55,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-05 16:37:55,889 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 9 states. [2018-04-05 16:37:56,393 WARN L148 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 22 [2018-04-05 16:37:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:56,665 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-05 16:37:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 16:37:56,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-04-05 16:37:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:56,667 INFO L225 Difference]: With dead ends: 85 [2018-04-05 16:37:56,668 INFO L226 Difference]: Without dead ends: 83 [2018-04-05 16:37:56,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-05 16:37:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-05 16:37:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-05 16:37:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-05 16:37:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-05 16:37:56,698 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 27 [2018-04-05 16:37:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:56,699 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-05 16:37:56,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 16:37:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-05 16:37:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-05 16:37:56,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:56,700 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:56,700 INFO L408 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2029255543, 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-05 16:37:56,726 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:56,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:56,907 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-05 16:37:56,907 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:56,942 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-05 16:37:56,991 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:56,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-05 16:37:56,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 16:37:56,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 16:37:56,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-05 16:37:56,993 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-04-05 16:37:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:57,378 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-04-05 16:37:57,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 16:37:57,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-05 16:37:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:57,388 INFO L225 Difference]: With dead ends: 104 [2018-04-05 16:37:57,388 INFO L226 Difference]: Without dead ends: 101 [2018-04-05 16:37:57,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-05 16:37:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-05 16:37:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-04-05 16:37:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-05 16:37:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-04-05 16:37:57,427 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 30 [2018-04-05 16:37:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:57,427 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-04-05 16:37:57,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 16:37:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-04-05 16:37:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-05 16:37:57,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:57,429 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:57,429 INFO L408 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2029255544, 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-05 16:37:57,451 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:57,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:57,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-05 16:37:57,912 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:57,983 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 12 treesize of output 10 [2018-04-05 16:37:57,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:58,033 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 16 treesize of output 12 [2018-04-05 16:37:58,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:58,047 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-05 16:37:58,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-05 16:37:58,132 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-05 16:37:58,168 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:58,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-05 16:37:58,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 16:37:58,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 16:37:58,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-05 16:37:58,169 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 9 states. [2018-04-05 16:37:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:59,039 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-04-05 16:37:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 16:37:59,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-05 16:37:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:59,041 INFO L225 Difference]: With dead ends: 101 [2018-04-05 16:37:59,042 INFO L226 Difference]: Without dead ends: 98 [2018-04-05 16:37:59,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-05 16:37:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-05 16:37:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-04-05 16:37:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-05 16:37:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-05 16:37:59,076 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 30 [2018-04-05 16:37:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:59,077 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-05 16:37:59,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 16:37:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-05 16:37:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-05 16:37:59,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:59,084 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:59,084 INFO L408 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:59,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2071992893, 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-05 16:37:59,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:59,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 16:37:59,324 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:37:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 16:37:59,503 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:37:59,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 16:37:59,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 16:37:59,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 16:37:59,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 16:37:59,504 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-04-05 16:37:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:37:59,550 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2018-04-05 16:37:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 16:37:59,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-04-05 16:37:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:37:59,551 INFO L225 Difference]: With dead ends: 158 [2018-04-05 16:37:59,551 INFO L226 Difference]: Without dead ends: 92 [2018-04-05 16:37:59,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 16:37:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-05 16:37:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-04-05 16:37:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-05 16:37:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-04-05 16:37:59,579 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 46 [2018-04-05 16:37:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:37:59,580 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-04-05 16:37:59,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 16:37:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-04-05 16:37:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-05 16:37:59,588 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:37:59,588 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:37:59,588 INFO L408 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:37:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 795302885, 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-05 16:37:59,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:37:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:37:59,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:37:59,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:37:59,837 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 20 treesize of output 21 [2018-04-05 16:37:59,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:37:59,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-05 16:37:59,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:37:59,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:37:59,928 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-05 16:37:59,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 16:38:00,104 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |c_main_#t~malloc13.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:00,145 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |main_#t~malloc13.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0) |main_#t~malloc13.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:00,185 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-05 16:38:00,186 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:00,347 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_12| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc13.base_12|) 0)) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc13.base_12| 1) |c_main_#t~malloc12.base| 0) |v_main_#t~malloc13.base_12| 0)))) is different from false [2018-04-05 16:38:00,369 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_12| Int) (|v_main_#t~malloc12.base_11| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_11| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc13.base_12| 1) |v_main_#t~malloc12.base_11| 0) |v_main_#t~malloc13.base_12| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc13.base_12|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_11|)))))) is different from false [2018-04-05 16:38:00,450 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-05 16:38:00,514 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:38:00,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 16:38:00,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 16:38:00,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 16:38:00,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 16:38:00,519 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 12 states. [2018-04-05 16:38:00,588 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc13.base_12| Int) (|v_main_#t~malloc12.base_11| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_11| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc13.base_12| 1) |v_main_#t~malloc12.base_11| 0) |v_main_#t~malloc13.base_12| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc13.base_12|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_11|)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-05 16:38:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:02,275 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2018-04-05 16:38:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 16:38:02,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-04-05 16:38:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:02,278 INFO L225 Difference]: With dead ends: 169 [2018-04-05 16:38:02,278 INFO L226 Difference]: Without dead ends: 148 [2018-04-05 16:38:02,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 16:38:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-05 16:38:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2018-04-05 16:38:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-05 16:38:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-04-05 16:38:02,315 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 47 [2018-04-05 16:38:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:02,315 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-04-05 16:38:02,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 16:38:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-04-05 16:38:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 16:38:02,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:02,326 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:38:02,326 INFO L408 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:02,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1021496817, 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-05 16:38:02,354 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:02,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:02,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:38:02,628 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 20 treesize of output 27 [2018-04-05 16:38:02,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 16:38:02,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:02,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:02,717 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-05 16:38:02,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 16:38:02,895 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |c_main_#t~malloc13.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:02,926 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |main_#t~malloc13.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0) |main_#t~malloc13.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:02,946 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-05 16:38:02,946 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:03,064 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_14| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc13.base_14| 1) |c_main_#t~malloc12.base| 0) |v_main_#t~malloc13.base_14| 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_14|) 0)))) is different from false [2018-04-05 16:38:03,072 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_14| Int) (|v_main_#t~malloc12.base_13| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_13| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_13|))) (= (store (store (store .cse0 |v_main_#t~malloc13.base_14| 1) |v_main_#t~malloc12.base_13| 0) |v_main_#t~malloc13.base_14| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc13.base_14|)))))) is different from false [2018-04-05 16:38:03,147 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-05 16:38:03,188 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:38:03,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 16:38:03,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 16:38:03,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 16:38:03,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 16:38:03,189 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 12 states. [2018-04-05 16:38:03,256 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc13.base_14| Int) (|v_main_#t~malloc12.base_13| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_13| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_13|))) (= (store (store (store .cse0 |v_main_#t~malloc13.base_14| 1) |v_main_#t~malloc12.base_13| 0) |v_main_#t~malloc13.base_14| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc13.base_14|))))))) is different from false [2018-04-05 16:38:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:05,245 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2018-04-05 16:38:05,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 16:38:05,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-04-05 16:38:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:05,248 INFO L225 Difference]: With dead ends: 219 [2018-04-05 16:38:05,248 INFO L226 Difference]: Without dead ends: 198 [2018-04-05 16:38:05,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 16:38:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-05 16:38:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 143. [2018-04-05 16:38:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-05 16:38:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-04-05 16:38:05,286 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 48 [2018-04-05 16:38:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:05,286 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-04-05 16:38:05,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 16:38:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-04-05 16:38:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 16:38:05,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:05,289 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:38:05,289 INFO L408 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:05,289 INFO L82 PathProgramCache]: Analyzing trace with hash -199785914, 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-05 16:38:05,316 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:05,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-05 16:38:05,591 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-05 16:38:05,678 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:38:05,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-05 16:38:05,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 16:38:05,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 16:38:05,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-05 16:38:05,680 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 7 states. [2018-04-05 16:38:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:06,511 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2018-04-05 16:38:06,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 16:38:06,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-04-05 16:38:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:06,513 INFO L225 Difference]: With dead ends: 143 [2018-04-05 16:38:06,513 INFO L226 Difference]: Without dead ends: 141 [2018-04-05 16:38:06,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-05 16:38:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-05 16:38:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-05 16:38:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-05 16:38:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2018-04-05 16:38:06,555 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 48 [2018-04-05 16:38:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:06,564 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2018-04-05 16:38:06,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 16:38:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2018-04-05 16:38:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 16:38:06,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:06,565 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:38:06,565 INFO L408 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash -199785913, 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-05 16:38:06,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:06,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:06,837 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 14 treesize of output 11 [2018-04-05 16:38:06,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 16:38:06,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:06,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:06,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 16:38:06,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-05 16:38:07,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-05 16:38:07,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-05 16:38:07,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 16:38:07,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 16:38:07,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 16:38:07,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-04-05 16:38:07,480 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 17 DAG size of output 17 [2018-04-05 16:38:07,664 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 18 DAG size of output 17 [2018-04-05 16:38:07,923 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-05 16:38:07,923 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:08,561 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 16:38:08,846 WARN L148 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 18 [2018-04-05 16:38:09,318 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 18 [2018-04-05 16:38:09,618 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 27 treesize of output 25 [2018-04-05 16:38:09,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:09,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-05 16:38:09,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:09,735 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-05 16:38:09,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-05 16:38:09,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:09,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:09,919 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 15 [2018-04-05 16:38:09,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-05 16:38:09,986 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:10,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:10,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 16:38:10,049 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:57, output treesize:17 [2018-04-05 16:38:10,429 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-05 16:38:10,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 16:38:10,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-05 16:38:10,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-05 16:38:10,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-05 16:38:10,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-04-05 16:38:10,477 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand 25 states. [2018-04-05 16:38:10,795 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 16:38:11,314 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 14 DAG size of output 13 [2018-04-05 16:38:12,275 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-04-05 16:38:12,612 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-04-05 16:38:12,974 WARN L151 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-04-05 16:38:13,551 WARN L148 SmtUtils]: Spent 137ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-05 16:38:14,194 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 47 DAG size of output 45 [2018-04-05 16:38:15,220 WARN L148 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-05 16:38:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:15,297 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-04-05 16:38:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-05 16:38:15,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-04-05 16:38:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:15,310 INFO L225 Difference]: With dead ends: 280 [2018-04-05 16:38:15,310 INFO L226 Difference]: Without dead ends: 273 [2018-04-05 16:38:15,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2018-04-05 16:38:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-05 16:38:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2018-04-05 16:38:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-05 16:38:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-04-05 16:38:15,377 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 48 [2018-04-05 16:38:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:15,378 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-04-05 16:38:15,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-05 16:38:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-04-05 16:38:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 16:38:15,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:15,379 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:38:15,380 INFO L408 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash 884000372, 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-05 16:38:15,412 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:15,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 16:38:15,638 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 16:38:15,754 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:38:15,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-05 16:38:15,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 16:38:15,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 16:38:15,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-05 16:38:15,755 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 7 states. [2018-04-05 16:38:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:16,262 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2018-04-05 16:38:16,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 16:38:16,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-04-05 16:38:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:16,276 INFO L225 Difference]: With dead ends: 197 [2018-04-05 16:38:16,276 INFO L226 Difference]: Without dead ends: 196 [2018-04-05 16:38:16,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-05 16:38:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-05 16:38:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-04-05 16:38:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-05 16:38:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 213 transitions. [2018-04-05 16:38:16,327 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 213 transitions. Word has length 48 [2018-04-05 16:38:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:16,327 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 213 transitions. [2018-04-05 16:38:16,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 16:38:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 213 transitions. [2018-04-05 16:38:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 16:38:16,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:16,329 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:38:16,329 INFO L408 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash 884000373, 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-05 16:38:16,358 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:16,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:16,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:38:16,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:16,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:16,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 16:38:16,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:38:16,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:38:16,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 16:38:16,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:16,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:16,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-05 16:38:16,822 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 14 treesize of output 11 [2018-04-05 16:38:16,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 16:38:16,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:16,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:16,875 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-05 16:38:16,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-05 16:38:16,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-05 16:38:16,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 16:38:16,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:17,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:17,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-05 16:38:17,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-05 16:38:19,206 WARN L148 SmtUtils]: Spent 1451ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-05 16:38:19,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-04-05 16:38:19,671 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 41 treesize of output 33 [2018-04-05 16:38:19,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:19,942 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 41 treesize of output 33 [2018-04-05 16:38:19,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:20,221 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 2 case distinctions, treesize of input 37 treesize of output 43 [2018-04-05 16:38:20,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-05 16:38:20,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-04-05 16:38:20,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-05 16:38:21,230 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-04-05 16:38:21,232 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-05 16:38:21,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-04-05 16:38:21,736 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-05 16:38:22,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-05 16:38:22,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:22,327 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 23 treesize of output 16 [2018-04-05 16:38:22,327 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:22,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-04-05 16:38:22,873 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:22,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-05 16:38:22,878 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:22,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-05 16:38:22,894 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:23,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-05 16:38:23,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 16:38:23,692 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-04-05 16:38:24,010 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 22 DAG size of output 20 [2018-04-05 16:38:24,370 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-05 16:38:24,371 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:27,337 WARN L151 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 39 DAG size of output 33 [2018-04-05 16:38:27,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-05 16:38:27,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:27,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-04-05 16:38:27,871 WARN L151 SmtUtils]: Spent 342ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-04-05 16:38:27,880 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 24 treesize of output 16 [2018-04-05 16:38:27,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:27,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-05 16:38:27,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:27,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:28,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:28,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-04-05 16:38:28,293 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-05 16:38:28,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 16:38:28,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-04-05 16:38:28,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-05 16:38:28,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-05 16:38:28,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-04-05 16:38:28,329 INFO L87 Difference]: Start difference. First operand 196 states and 213 transitions. Second operand 35 states. [2018-04-05 16:38:30,318 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 61 DAG size of output 53 [2018-04-05 16:38:30,611 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 67 DAG size of output 59 [2018-04-05 16:38:30,922 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 77 DAG size of output 66 [2018-04-05 16:38:31,516 WARN L151 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 74 DAG size of output 66 [2018-04-05 16:38:32,053 WARN L151 SmtUtils]: Spent 323ms on a formula simplification. DAG size of input: 74 DAG size of output 63 [2018-04-05 16:38:32,404 WARN L151 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 72 DAG size of output 61 [2018-04-05 16:38:37,073 WARN L151 SmtUtils]: Spent 4477ms on a formula simplification. DAG size of input: 72 DAG size of output 64 [2018-04-05 16:38:37,357 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 67 DAG size of output 59 [2018-04-05 16:38:37,688 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 70 DAG size of output 62 [2018-04-05 16:38:38,084 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-04-05 16:38:38,844 WARN L151 SmtUtils]: Spent 488ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-04-05 16:38:39,218 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 80 DAG size of output 65 [2018-04-05 16:38:39,452 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 70 DAG size of output 62 [2018-04-05 16:38:39,812 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 76 DAG size of output 68 [2018-04-05 16:38:40,383 WARN L151 SmtUtils]: Spent 358ms on a formula simplification. DAG size of input: 59 DAG size of output 55 [2018-04-05 16:38:41,060 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-04-05 16:38:41,925 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 68 DAG size of output 62 [2018-04-05 16:38:42,359 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 62 DAG size of output 56 [2018-04-05 16:38:45,672 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-04-05 16:38:46,066 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 68 DAG size of output 62 [2018-04-05 16:38:46,414 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 62 DAG size of output 56 [2018-04-05 16:38:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:48,351 INFO L93 Difference]: Finished difference Result 362 states and 394 transitions. [2018-04-05 16:38:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-05 16:38:48,352 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-04-05 16:38:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:48,355 INFO L225 Difference]: With dead ends: 362 [2018-04-05 16:38:48,355 INFO L226 Difference]: Without dead ends: 361 [2018-04-05 16:38:48,367 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=673, Invalid=3883, Unknown=0, NotChecked=0, Total=4556 [2018-04-05 16:38:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-05 16:38:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 248. [2018-04-05 16:38:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-05 16:38:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 271 transitions. [2018-04-05 16:38:48,428 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 271 transitions. Word has length 48 [2018-04-05 16:38:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:48,428 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 271 transitions. [2018-04-05 16:38:48,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-05 16:38:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 271 transitions. [2018-04-05 16:38:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 16:38:48,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:48,429 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:38:48,429 INFO L408 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2005570218, 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-05 16:38:48,451 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:48,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:48,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:38:48,703 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 20 treesize of output 21 [2018-04-05 16:38:48,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:38:48,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-05 16:38:48,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:48,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:48,776 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-05 16:38:48,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 16:38:48,884 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |c_main_#t~malloc13.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:48,895 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |main_#t~malloc13.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0) |main_#t~malloc13.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:48,908 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-05 16:38:48,908 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:49,021 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_18| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc13.base_18| 1) |c_main_#t~malloc12.base| 0) |v_main_#t~malloc13.base_18| 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_18|) 0)))) is different from false [2018-04-05 16:38:49,038 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc12.base_17| Int) (|v_main_#t~malloc13.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_17| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_17|))) (= (store (store (store .cse0 |v_main_#t~malloc13.base_18| 1) |v_main_#t~malloc12.base_17| 0) |v_main_#t~malloc13.base_18| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc13.base_18|) 0))))) is different from false [2018-04-05 16:38:49,104 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-05 16:38:49,171 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:38:49,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 16:38:49,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 16:38:49,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 16:38:49,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 16:38:49,172 INFO L87 Difference]: Start difference. First operand 248 states and 271 transitions. Second operand 12 states. [2018-04-05 16:38:49,220 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc12.base_17| Int) (|v_main_#t~malloc13.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_17| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_17|))) (= (store (store (store .cse0 |v_main_#t~malloc13.base_18| 1) |v_main_#t~malloc12.base_17| 0) |v_main_#t~malloc13.base_18| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc13.base_18|) 0)))))) is different from false [2018-04-05 16:38:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:50,889 INFO L93 Difference]: Finished difference Result 375 states and 410 transitions. [2018-04-05 16:38:50,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 16:38:50,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-04-05 16:38:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:50,895 INFO L225 Difference]: With dead ends: 375 [2018-04-05 16:38:50,895 INFO L226 Difference]: Without dead ends: 354 [2018-04-05 16:38:50,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 16:38:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-05 16:38:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 248. [2018-04-05 16:38:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-05 16:38:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 271 transitions. [2018-04-05 16:38:50,968 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 271 transitions. Word has length 48 [2018-04-05 16:38:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:50,968 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 271 transitions. [2018-04-05 16:38:50,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 16:38:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 271 transitions. [2018-04-05 16:38:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-05 16:38:50,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:50,970 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 16:38:50,970 INFO L408 AbstractCegarLoop]: === Iteration 17 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2137052138, 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-05 16:38:50,998 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:51,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:51,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:38:51,237 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 20 treesize of output 27 [2018-04-05 16:38:51,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 16:38:51,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:51,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:51,292 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-05 16:38:51,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 16:38:51,397 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |c_main_#t~malloc13.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:51,413 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |main_#t~malloc13.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0) |main_#t~malloc13.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-05 16:38:51,426 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-05 16:38:51,426 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:51,541 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc13.base_20| 1) |c_main_#t~malloc12.base| 0) |v_main_#t~malloc13.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_20|))))) is different from false [2018-04-05 16:38:51,558 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc12.base_19| Int) (|v_main_#t~malloc13.base_20| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_19| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc13.base_20|))) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc13.base_20| 1) |v_main_#t~malloc12.base_19| 0) |v_main_#t~malloc13.base_20| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_19|)))))) is different from false [2018-04-05 16:38:51,620 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-05 16:38:51,678 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 16:38:51,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 16:38:51,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 16:38:51,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 16:38:51,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 16:38:51,680 INFO L87 Difference]: Start difference. First operand 248 states and 271 transitions. Second operand 12 states. [2018-04-05 16:38:51,740 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc12.base_19| Int) (|v_main_#t~malloc13.base_20| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc12.base_19| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc13.base_20|))) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc13.base_20| 1) |v_main_#t~malloc12.base_19| 0) |v_main_#t~malloc13.base_20| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_19|)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-05 16:38:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:38:53,418 INFO L93 Difference]: Finished difference Result 251 states and 271 transitions. [2018-04-05 16:38:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 16:38:53,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-04-05 16:38:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:38:53,421 INFO L225 Difference]: With dead ends: 251 [2018-04-05 16:38:53,421 INFO L226 Difference]: Without dead ends: 230 [2018-04-05 16:38:53,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 16:38:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-05 16:38:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 122. [2018-04-05 16:38:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-05 16:38:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-04-05 16:38:53,470 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 49 [2018-04-05 16:38:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:38:53,470 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-04-05 16:38:53,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 16:38:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-04-05 16:38:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-05 16:38:53,471 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:38:53,472 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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] [2018-04-05 16:38:53,472 INFO L408 AbstractCegarLoop]: === Iteration 18 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:38:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2006281386, now seen corresponding path program 2 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-05 16:38:53,498 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:38:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:38:53,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:38:53,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:38:53,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:53,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:53,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 16:38:53,653 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-05 16:38:53,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:38:53,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:53,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:53,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:53,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-05 16:38:54,038 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-05 16:38:54,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-05 16:38:54,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 16:38:54,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 16:38:54,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 16:38:54,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-05 16:38:54,377 WARN L148 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 16:38:54,622 WARN L148 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 15 [2018-04-05 16:38:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 16:38:54,987 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:38:55,827 WARN L148 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 16:38:57,624 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 13 [2018-04-05 16:38:57,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-05 16:38:57,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:38:57,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:38:57,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 16:38:57,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-04-05 16:38:57,985 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 18 DAG size of output 16 [2018-04-05 16:38:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 16:38:58,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 16:38:58,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-05 16:38:58,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-05 16:38:58,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-05 16:38:58,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-04-05 16:38:58,273 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 30 states. [2018-04-05 16:39:00,348 WARN L151 SmtUtils]: Spent 699ms on a formula simplification. DAG size of input: 36 DAG size of output 34 [2018-04-05 16:39:00,855 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 40 DAG size of output 37 [2018-04-05 16:39:01,350 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 44 DAG size of output 38 [2018-04-05 16:39:01,625 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 42 DAG size of output 39 [2018-04-05 16:39:02,162 WARN L151 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 35 DAG size of output 35 [2018-04-05 16:39:02,534 WARN L151 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 39 DAG size of output 38 [2018-04-05 16:39:02,952 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 43 DAG size of output 42 [2018-04-05 16:39:03,691 WARN L151 SmtUtils]: Spent 584ms on a formula simplification. DAG size of input: 44 DAG size of output 42 [2018-04-05 16:39:04,711 WARN L151 SmtUtils]: Spent 653ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-05 16:39:05,002 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-05 16:39:05,510 WARN L151 SmtUtils]: Spent 362ms on a formula simplification. DAG size of input: 44 DAG size of output 39 [2018-04-05 16:39:05,838 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-04-05 16:39:06,367 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 48 DAG size of output 43 [2018-04-05 16:39:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:39:06,396 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2018-04-05 16:39:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-05 16:39:06,397 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-04-05 16:39:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:39:06,401 INFO L225 Difference]: With dead ends: 158 [2018-04-05 16:39:06,401 INFO L226 Difference]: Without dead ends: 151 [2018-04-05 16:39:06,402 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=515, Invalid=2035, Unknown=0, NotChecked=0, Total=2550 [2018-04-05 16:39:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-05 16:39:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 79. [2018-04-05 16:39:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-05 16:39:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-04-05 16:39:06,446 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 66 [2018-04-05 16:39:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:39:06,447 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-04-05 16:39:06,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-05 16:39:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-04-05 16:39:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-05 16:39:06,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 16:39:06,448 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-04-05 16:39:06,448 INFO L408 AbstractCegarLoop]: === Iteration 19 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 16:39:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 852201644, now seen corresponding path program 2 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-05 16:39:06,482 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 16:39:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 16:39:06,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 16:39:06,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:39:06,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-05 16:39:06,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-05 16:39:06,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:39:06,746 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-05 16:39:06,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:39:06,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 16:39:06,814 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-05 16:39:06,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-05 16:39:06,956 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 15 treesize of output 12 [2018-04-05 16:39:06,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 12 treesize of output 11 [2018-04-05 16:39:06,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:39:06,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-05 16:39:07,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 29 [2018-04-05 16:39:07,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 12 [2018-04-05 16:39:07,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:07,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:39:07,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 16:39:07,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-05 16:39:12,586 WARN L148 SmtUtils]: Spent 2129ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-05 16:39:13,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-04-05 16:39:13,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 48 treesize of output 38 [2018-04-05 16:39:13,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:13,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-04-05 16:39:13,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-05 16:39:13,951 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 40 treesize of output 30 [2018-04-05 16:39:13,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:14,302 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 2 case distinctions, treesize of input 30 treesize of output 37 [2018-04-05 16:39:14,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-05 16:39:14,926 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-04-05 16:39:14,928 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-05 16:39:15,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-05 16:39:15,586 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:15,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 26 [2018-04-05 16:39:15,598 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:15,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-04-05 16:39:15,934 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:16,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-04-05 16:39:16,281 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-05 16:39:16,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-05 16:39:16,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 16:39:16,948 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-04-05 16:39:17,323 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 21 DAG size of output 19 [2018-04-05 16:39:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 16:39:17,800 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 16:39:22,831 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 41 DAG size of output 35 [2018-04-05 16:39:22,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-04-05 16:39:23,161 WARN L151 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-04-05 16:39:23,165 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 26 treesize of output 18 [2018-04-05 16:39:23,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:23,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-05 16:39:23,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:23,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 16:39:23,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 16:39:23,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 16:39:23,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 16:39:23,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:35 [2018-04-05 16:39:23,740 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 18 DAG size of output 16 [2018-04-05 16:39:24,702 WARN L148 SmtUtils]: Spent 780ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-05 16:39:25,710 WARN L148 SmtUtils]: Spent 812ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-05 16:39:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 16:39:25,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 16:39:25,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2018-04-05 16:39:25,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-05 16:39:25,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-05 16:39:25,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2018-04-05 16:39:25,817 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 42 states. [2018-04-05 16:39:27,292 WARN L148 SmtUtils]: Spent 125ms on a formula simplification that was a NOOP. DAG size: 31 [2018-04-05 16:39:28,298 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 32 DAG size of output 28 [2018-04-05 16:39:28,709 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 42 DAG size of output 34 [2018-04-05 16:39:29,254 WARN L151 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 72 DAG size of output 39 [2018-04-05 16:39:29,781 WARN L151 SmtUtils]: Spent 349ms on a formula simplification. DAG size of input: 76 DAG size of output 52 [2018-04-05 16:39:30,558 WARN L151 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 80 DAG size of output 55 [2018-04-05 16:39:31,272 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 74 DAG size of output 50 [2018-04-05 16:39:32,091 WARN L151 SmtUtils]: Spent 620ms on a formula simplification. DAG size of input: 78 DAG size of output 56 [2018-04-05 16:39:33,025 WARN L151 SmtUtils]: Spent 587ms on a formula simplification. DAG size of input: 82 DAG size of output 60 [2018-04-05 16:39:33,490 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 51 DAG size of output 39 [2018-04-05 16:39:34,385 WARN L151 SmtUtils]: Spent 666ms on a formula simplification. DAG size of input: 67 DAG size of output 49 [2018-04-05 16:39:35,090 WARN L151 SmtUtils]: Spent 414ms on a formula simplification. DAG size of input: 64 DAG size of output 50 [2018-04-05 16:39:37,313 WARN L151 SmtUtils]: Spent 1926ms on a formula simplification. DAG size of input: 47 DAG size of output 39 [2018-04-05 16:39:39,944 WARN L151 SmtUtils]: Spent 2213ms on a formula simplification. DAG size of input: 53 DAG size of output 45 [2018-04-05 16:39:46,419 WARN L151 SmtUtils]: Spent 6289ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-04-05 16:39:47,198 WARN L151 SmtUtils]: Spent 594ms on a formula simplification. DAG size of input: 60 DAG size of output 49 [2018-04-05 16:39:47,875 WARN L151 SmtUtils]: Spent 417ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-04-05 16:39:48,424 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 53 DAG size of output 45 [2018-04-05 16:39:48,895 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 56 DAG size of output 48 [2018-04-05 16:39:49,396 WARN L151 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 65 DAG size of output 52 [2018-04-05 16:39:50,162 WARN L151 SmtUtils]: Spent 492ms on a formula simplification. DAG size of input: 65 DAG size of output 54 [2018-04-05 16:39:52,786 WARN L151 SmtUtils]: Spent 2420ms on a formula simplification. DAG size of input: 63 DAG size of output 51 [2018-04-05 16:39:55,271 WARN L151 SmtUtils]: Spent 323ms on a formula simplification. DAG size of input: 55 DAG size of output 47 [2018-04-05 16:40:00,310 WARN L151 SmtUtils]: Spent 4748ms on a formula simplification. DAG size of input: 72 DAG size of output 59 [2018-04-05 16:40:03,874 WARN L151 SmtUtils]: Spent 3288ms on a formula simplification. DAG size of input: 75 DAG size of output 58 [2018-04-05 16:40:04,610 WARN L151 SmtUtils]: Spent 546ms on a formula simplification. DAG size of input: 58 DAG size of output 46 [2018-04-05 16:40:05,316 WARN L151 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 52 DAG size of output 40 [2018-04-05 16:40:07,835 WARN L151 SmtUtils]: Spent 2250ms on a formula simplification. DAG size of input: 58 DAG size of output 46 [2018-04-05 16:40:17,117 WARN L151 SmtUtils]: Spent 8999ms on a formula simplification. DAG size of input: 65 DAG size of output 53 [2018-04-05 16:40:18,400 WARN L151 SmtUtils]: Spent 1072ms on a formula simplification. DAG size of input: 65 DAG size of output 50 [2018-04-05 16:40:19,034 WARN L151 SmtUtils]: Spent 375ms on a formula simplification. DAG size of input: 63 DAG size of output 48 [2018-04-05 16:40:19,568 WARN L151 SmtUtils]: Spent 344ms on a formula simplification. DAG size of input: 61 DAG size of output 49 [2018-04-05 16:40:20,086 WARN L151 SmtUtils]: Spent 335ms on a formula simplification. DAG size of input: 70 DAG size of output 52 [2018-04-05 16:40:20,642 WARN L151 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 70 DAG size of output 54 [2018-04-05 16:40:21,163 WARN L151 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 68 DAG size of output 51 [2018-04-05 16:40:21,725 WARN L151 SmtUtils]: Spent 364ms on a formula simplification. DAG size of input: 60 DAG size of output 48 [2018-04-05 16:40:22,894 WARN L151 SmtUtils]: Spent 1020ms on a formula simplification. DAG size of input: 77 DAG size of output 60 [2018-04-05 16:40:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 16:40:22,952 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-04-05 16:40:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-05 16:40:22,956 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 69 [2018-04-05 16:40:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 16:40:22,956 INFO L225 Difference]: With dead ends: 105 [2018-04-05 16:40:22,957 INFO L226 Difference]: Without dead ends: 0 [2018-04-05 16:40:22,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 67.1s TimeCoverageRelationStatistics Valid=1273, Invalid=5532, Unknown=1, NotChecked=0, Total=6806 [2018-04-05 16:40:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-05 16:40:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-05 16:40:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-05 16:40:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-05 16:40:22,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-04-05 16:40:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 16:40:22,967 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-05 16:40:22,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-05 16:40:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-05 16:40:22,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-05 16:40:22,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-04-05 16:40:23,977 WARN L151 SmtUtils]: Spent 993ms on a formula simplification. DAG size of input: 265 DAG size of output 258 [2018-04-05 16:41:55,101 WARN L151 SmtUtils]: Spent 91077ms on a formula simplification. DAG size of input: 301 DAG size of output 135 [2018-04-05 16:41:55,339 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 162 DAG size of output 1 [2018-04-05 16:41:56,000 WARN L151 SmtUtils]: Spent 660ms on a formula simplification. DAG size of input: 153 DAG size of output 69 [2018-04-05 16:41:56,034 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-04-05 16:41:56,035 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-04-05 16:41:56,035 INFO L412 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-04-05 16:41:56,035 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-04-05 16:41:56,035 INFO L416 ceAbstractionStarter]: For program point L544'''''''''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,035 INFO L416 ceAbstractionStarter]: For program point L544'''''''''''''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,035 INFO L416 ceAbstractionStarter]: For program point subseqErr5RequiresViolation(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,035 INFO L416 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-04-05 16:41:56,035 INFO L416 ceAbstractionStarter]: For program point L540(lines 540 552) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-04-05 16:41:56,036 INFO L416 ceAbstractionStarter]: For program point subseqErr4RequiresViolation(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,037 INFO L412 ceAbstractionStarter]: At program point L544''''''''''''''(lines 544 549) the Hoare annotation is: (let ((.cse0 (select |#length| |subseq_#in~s.base|))) (or (not (= (select (select |#memory_int| |subseq_#in~t.base|) (+ (select |#length| |subseq_#in~t.base|) (- 1))) 0)) (not (= 0 (select (select |#memory_int| |subseq_#in~s.base|) (+ .cse0 (- 1))))) (or (not (= 1 (select |#valid| |subseq_#in~s.base|))) (not (= 1 (select |#valid| |subseq_#in~t.base|))) (< |subseq_#in~s.offset| 0) (not (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_7| Int) (|v_main_#t~malloc12.base_BEFORE_CALL_7| Int)) (and (not (= |v_main_#t~malloc13.base_BEFORE_CALL_7| |v_main_#t~malloc12.base_BEFORE_CALL_7|)) (= (select |#valid| |v_main_#t~malloc12.base_BEFORE_CALL_7|) 1) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_7|) 1)))) (< |subseq_#in~t.offset| 0) (< .cse0 (+ |subseq_#in~s.offset| 1)) (not (exists ((main_~length2~0 Int)) (and (<= 1 main_~length2~0) (= (select (select |#memory_int| |subseq_#in~t.base|) (+ |subseq_#in~t.offset| main_~length2~0 (- 1))) 0) (<= (+ |subseq_#in~t.offset| main_~length2~0) (select |#length| |subseq_#in~t.base|)))))) (let ((.cse1 (select |#length| subseq_~ps~0.base))) (and (= 0 (select (select |#memory_int| subseq_~s.base) (+ (select |#length| subseq_~s.base) (- 1)))) (let ((.cse2 (select |#length| subseq_~pt~0.base))) (and (and (exists ((main_~length2~0 Int)) (and (= 0 (select (select |#memory_int| subseq_~t.base) (+ subseq_~t.offset main_~length2~0 (- 1)))) (<= 1 main_~length2~0) (<= (+ subseq_~t.offset main_~length2~0) (select |#length| subseq_~t.base)))) (<= 0 subseq_~ps~0.offset) (<= 0 subseq_~t.offset) (= 1 (select |#valid| subseq_~ps~0.base)) (<= (+ subseq_~ps~0.offset 1) .cse1) (<= 0 subseq_~pt~0.offset) (= 1 (select |#valid| subseq_~pt~0.base)) (= (select |#valid| subseq_~t.base) 1) (exists ((v_main_~nondetString1~0.offset_BEFORE_CALL_2 Int) (main_~length1~0 Int)) (and (= (select (select |#memory_int| subseq_~s.base) (+ v_main_~nondetString1~0.offset_BEFORE_CALL_2 main_~length1~0 (- 1))) 0) (<= 1 main_~length1~0) (<= (+ v_main_~nondetString1~0.offset_BEFORE_CALL_2 main_~length1~0) (select |#length| subseq_~s.base)) (<= subseq_~s.offset v_main_~nondetString1~0.offset_BEFORE_CALL_2))) (= (select |#valid| subseq_~s.base) 1) (<= 0 subseq_~s.offset) (<= (+ subseq_~pt~0.offset 1) .cse2)) (= (select (select |#memory_int| subseq_~t.base) (+ (select |#length| subseq_~t.base) (- 1))) 0) (= 0 (select (select |#memory_int| subseq_~pt~0.base) (+ .cse2 (- 1)))))) (= 0 (select (select |#memory_int| subseq_~ps~0.base) (+ .cse1 (- 1)))))) (not (exists ((main_~nondetString2~0.base Int) (main_~nondetString2~0.offset Int)) (and (not (= |subseq_#in~s.base| main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base) (- 1))))))))) [2018-04-05 16:41:56,037 INFO L416 ceAbstractionStarter]: For program point L544''''''''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,037 INFO L416 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-04-05 16:41:56,037 INFO L416 ceAbstractionStarter]: For program point L544'''''''''''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,037 INFO L416 ceAbstractionStarter]: For program point L544'''''''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,037 INFO L416 ceAbstractionStarter]: For program point subseqErr7RequiresViolation(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,037 INFO L416 ceAbstractionStarter]: For program point subseqEXIT(lines 540 552) no Hoare annotation was computed. [2018-04-05 16:41:56,038 INFO L416 ceAbstractionStarter]: For program point L544''''''(lines 544 549) no Hoare annotation was computed. [2018-04-05 16:41:56,038 INFO L416 ceAbstractionStarter]: For program point subseqErr2RequiresViolation(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,039 INFO L416 ceAbstractionStarter]: For program point L545''(lines 545 547) no Hoare annotation was computed. [2018-04-05 16:41:56,039 INFO L416 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,040 INFO L416 ceAbstractionStarter]: For program point subseqErr0RequiresViolation(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,040 INFO L416 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,040 INFO L416 ceAbstractionStarter]: For program point L550'''(line 550) no Hoare annotation was computed. [2018-04-05 16:41:56,040 INFO L416 ceAbstractionStarter]: For program point subseqErr1RequiresViolation(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,040 INFO L419 ceAbstractionStarter]: At program point subseqENTRY(lines 540 552) the Hoare annotation is: true [2018-04-05 16:41:56,040 INFO L416 ceAbstractionStarter]: For program point subseqErr9RequiresViolation(line 550) no Hoare annotation was computed. [2018-04-05 16:41:56,040 INFO L416 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,040 INFO L416 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point subseqErr8RequiresViolation(line 550) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point subseqFINAL(lines 540 552) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point L544''''''''''''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point L550(lines 550 551) no Hoare annotation was computed. [2018-04-05 16:41:56,041 INFO L416 ceAbstractionStarter]: For program point L545'''''''(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point L545''''''(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point subseqErr3RequiresViolation(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point L545''''''''(lines 545 547) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point subseqErr6RequiresViolation(line 545) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point L544'''''''''''''''(lines 544 549) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64EXIT(lines 61 65) no Hoare annotation was computed. [2018-04-05 16:41:56,042 INFO L416 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64ENTRY(lines 61 65) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point L64'(line 64) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64FINAL(lines 61 65) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32ENTRY(lines 56 60) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point L59'(line 59) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32FINAL(lines 56 60) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32EXIT(lines 56 60) no Hoare annotation was computed. [2018-04-05 16:41:56,043 INFO L419 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-04-05 16:41:56,044 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point mainErr1RequiresViolation(line 564) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-04-05 16:41:56,044 INFO L416 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-04-05 16:41:56,045 INFO L412 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse1 (select |#length| main_~nondetString1~0.base)) (.cse0 (store |old(#valid)| |main_#t~malloc12.base| 1)) (.cse2 (select |#length| main_~nondetString2~0.base))) (and (= main_~nondetString2~0.offset 0) (= 0 main_~nondetString1~0.offset) (= |main_#t~malloc12.offset| 0) (= |#valid| (store .cse0 |main_#t~malloc13.base| 1)) (not (= main_~nondetString2~0.base main_~nondetString1~0.base)) (= .cse1 main_~length1~0) (exists ((main_~length2~0 Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset main_~length2~0 (- 1)))) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) (select |#length| main_~nondetString2~0.base)))) (= 1 (select |#valid| main_~nondetString1~0.base)) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ .cse2 (- 1)))) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ .cse1 (- 1)))) (= 0 |main_#t~malloc13.offset|) (= (select |#length| |main_#t~malloc12.base|) main_~length1~0) (= (select .cse0 |main_#t~malloc13.base|) 0) (exists ((main_~length1~0 Int)) (and (<= (+ main_~nondetString1~0.offset main_~length1~0) (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= (select (select |#memory_int| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset main_~length1~0 (- 1))) 0))) (= .cse2 main_~length2~0) (= (select |#length| |main_#t~malloc13.base|) main_~length2~0) (= 1 (select |#valid| main_~nondetString2~0.base)) (= 0 (select |old(#valid)| |main_#t~malloc12.base|)) (not (= |main_#t~malloc13.base| main_~nondetString1~0.base)))) [2018-04-05 16:41:56,045 INFO L416 ceAbstractionStarter]: For program point mainErr0RequiresViolation(line 564) no Hoare annotation was computed. [2018-04-05 16:41:56,045 INFO L416 ceAbstractionStarter]: For program point mainErr2RequiresViolation(line 565) no Hoare annotation was computed. [2018-04-05 16:41:56,045 INFO L416 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-04-05 16:41:56,045 INFO L416 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-04-05 16:41:56,045 INFO L416 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-04-05 16:41:56,045 INFO L416 ceAbstractionStarter]: For program point L556''(lines 553 567) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point mainErr3RequiresViolation(line 565) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 553 567) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point mainErr4EnsuresViolationMEMORY_LEAK(lines 553 567) no Hoare annotation was computed. [2018-04-05 16:41:56,046 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 553 567) no Hoare annotation was computed. [2018-04-05 16:41:56,047 INFO L412 ceAbstractionStarter]: At program point mainENTRY(lines 553 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-04-05 16:41:56,047 INFO L416 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-04-05 16:41:56,047 INFO L416 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-04-05 16:41:56,047 INFO L416 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-04-05 16:41:56,047 INFO L416 ceAbstractionStarter]: For program point L563'''(line 563) no Hoare annotation was computed. [2018-04-05 16:41:56,047 INFO L416 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-04-05 16:41:56,047 INFO L416 ceAbstractionStarter]: For program point L566''(line 566) no Hoare annotation was computed. [2018-04-05 16:41:56,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,103 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,103 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,103 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,104 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,104 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,104 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,104 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,105 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,105 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,105 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.offset,QUANTIFIED] [2018-04-05 16:41:56,106 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,114 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,114 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,114 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,115 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,115 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,115 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,115 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,117 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,117 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,117 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,117 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,118 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.offset,QUANTIFIED] [2018-04-05 16:41:56,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:41:56 BoogieIcfgContainer [2018-04-05 16:41:56,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 16:41:56,187 INFO L168 Benchmark]: Toolchain (without parser) took 252099.82 ms. Allocated memory was 297.3 MB in the beginning and 617.1 MB in the end (delta: 319.8 MB). Free memory was 234.8 MB in the beginning and 331.1 MB in the end (delta: -96.3 MB). Peak memory consumption was 284.0 MB. Max. memory is 5.3 GB. [2018-04-05 16:41:56,188 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 297.3 MB. Free memory is still 259.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 16:41:56,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1195.20 ms. Allocated memory is still 297.3 MB. Free memory was 233.8 MB in the beginning and 210.8 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-04-05 16:41:56,189 INFO L168 Benchmark]: Boogie Preprocessor took 217.80 ms. Allocated memory is still 297.3 MB. Free memory was 210.8 MB in the beginning and 207.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-05 16:41:56,189 INFO L168 Benchmark]: RCFGBuilder took 1553.68 ms. Allocated memory was 297.3 MB in the beginning and 447.2 MB in the end (delta: 149.9 MB). Free memory was 207.9 MB in the beginning and 380.0 MB in the end (delta: -172.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-04-05 16:41:56,193 INFO L168 Benchmark]: TraceAbstraction took 249117.29 ms. Allocated memory was 447.2 MB in the beginning and 617.1 MB in the end (delta: 169.9 MB). Free memory was 380.0 MB in the beginning and 331.1 MB in the end (delta: 48.9 MB). Peak memory consumption was 279.3 MB. Max. memory is 5.3 GB. [2018-04-05 16:41:56,201 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.23 ms. Allocated memory is still 297.3 MB. Free memory is still 259.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 1195.20 ms. Allocated memory is still 297.3 MB. Free memory was 233.8 MB in the beginning and 210.8 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 217.80 ms. Allocated memory is still 297.3 MB. Free memory was 210.8 MB in the beginning and 207.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1553.68 ms. Allocated memory was 297.3 MB in the beginning and 447.2 MB in the end (delta: 149.9 MB). Free memory was 207.9 MB in the beginning and 380.0 MB in the end (delta: -172.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 249117.29 ms. Allocated memory was 447.2 MB in the beginning and 617.1 MB in the end (delta: 169.9 MB). Free memory was 380.0 MB in the beginning and 331.1 MB in the end (delta: 48.9 MB). Peak memory consumption was 279.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-04-05 16:41:56,234 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,234 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,234 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.offset,QUANTIFIED] [2018-04-05 16:41:56,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc12.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~malloc13.base_BEFORE_CALL_7,QUANTIFIED] [2018-04-05 16:41:56,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,263 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~0,QUANTIFIED] [2018-04-05 16:41:56,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~0,QUANTIFIED] [2018-04-05 16:41:56,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-04-05 16:41:56,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.offset,QUANTIFIED] [2018-04-05 16:41:56,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~0.base,QUANTIFIED] [2018-04-05 16:41:56,281 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,281 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,281 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,283 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,283 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,283 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,283 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-04-05 16:41:56,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-04-05 16:41:56,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((!(unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + -1] == 0) || !(0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1])) || (((((!(1 == \valid[s]) || !(1 == \valid[t])) || s < 0) || !(\exists v_main_#t~malloc13.base_BEFORE_CALL_7 : int, v_main_#t~malloc12.base_BEFORE_CALL_7 : int :: (!(v_main_#t~malloc13.base_BEFORE_CALL_7 == v_main_#t~malloc12.base_BEFORE_CALL_7) && \valid[v_main_#t~malloc12.base_BEFORE_CALL_7] == 1) && \valid[v_main_#t~malloc13.base_BEFORE_CALL_7] == 1)) || t < 0) || unknown-#length-unknown[s] < s + 1) || !(\exists main_~length2~0 : int :: (1 <= main_~length2~0 && unknown-#memory_int-unknown[t][t + main_~length2~0 + -1] == 0) && t + main_~length2~0 <= unknown-#length-unknown[t])) || ((0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] && (((((((((((((\exists main_~length2~0 : int :: (0 == unknown-#memory_int-unknown[t][t + main_~length2~0 + -1] && 1 <= main_~length2~0) && t + main_~length2~0 <= unknown-#length-unknown[t]) && 0 <= ps) && 0 <= t) && 1 == \valid[ps]) && ps + 1 <= unknown-#length-unknown[ps]) && 0 <= pt) && 1 == \valid[pt]) && \valid[t] == 1) && (\exists v_main_~nondetString1~0.offset_BEFORE_CALL_2 : int, main_~length1~0 : int :: ((unknown-#memory_int-unknown[s][v_main_~nondetString1~0.offset_BEFORE_CALL_2 + main_~length1~0 + -1] == 0 && 1 <= main_~length1~0) && v_main_~nondetString1~0.offset_BEFORE_CALL_2 + main_~length1~0 <= unknown-#length-unknown[s]) && s <= v_main_~nondetString1~0.offset_BEFORE_CALL_2)) && \valid[s] == 1) && 0 <= s) && pt + 1 <= unknown-#length-unknown[pt]) && unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + -1] == 0) && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && 0 == unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1])) || !(\exists main_~nondetString2~0.base : int, main_~nondetString2~0.offset : int :: !(s == main_~nondetString2~0.base) && 0 == unknown-#memory_int-unknown[main_~nondetString2~0.base][main_~nondetString2~0.offset + unknown-#length-unknown[main_~nondetString2~0.base] + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 97 locations, 15 error locations. SAFE Result, 248.8s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 103.5s AutomataDifference, 0.0s DeadEndRemovalTime, 93.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1437 SDtfs, 3463 SDslu, 6023 SDs, 0 SdLazy, 4362 SolverSat, 208 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1665 GetRequests, 1273 SyntacticMatches, 18 SemanticMatches, 374 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 111.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=15, 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.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 540 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 401 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1586 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 10266 FormulaSimplificationTreeSizeReductionInter, 92.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 48.5s InterpolantComputationTime, 757 NumberOfCodeBlocks, 757 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1476 ConstructedInterpolants, 261 QuantifiedInterpolants, 845862 SizeOfPredicates, 163 NumberOfNonLiveVariables, 2368 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 38 InterpolantComputations, 30 PerfectInterpolantSequences, 39/142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-05_16-41-56-320.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_16-41-56-320.csv Received shutdown request...