java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 21:17:52,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 21:17:52,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 21:17:52,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 21:17:52,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 21:17:52,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 21:17:52,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 21:17:52,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 21:17:52,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 21:17:52,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 21:17:52,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 21:17:52,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 21:17:52,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 21:17:52,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 21:17:52,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 21:17:52,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 21:17:52,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 21:17:52,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 21:17:52,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 21:17:52,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 21:17:52,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 21:17:52,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 21:17:52,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 21:17:52,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 21:17:52,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 21:17:52,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 21:17:52,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 21:17:52,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 21:17:52,321 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 21:17:52,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 21:17:52,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 21:17:52,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 21:17:52,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 21:17:52,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 21:17:52,348 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 21:17:52,348 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 21:17:52,349 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 21:17:52,349 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 21:17:52,349 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 21:17:52,349 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 21:17:52,349 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 21:17:52,350 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 21:17:52,350 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 21:17:52,350 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 21:17:52,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 21:17:52,351 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 21:17:52,351 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 21:17:52,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 21:17:52,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 21:17:52,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 21:17:52,352 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 21:17:52,352 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 21:17:52,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 21:17:52,352 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 21:17:52,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 21:17:52,353 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 21:17:52,353 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 21:17:52,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 21:17:52,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:17:52,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 21:17:52,354 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 21:17:52,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 21:17:52,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 21:17:52,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 21:17:52,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:52,355 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 21:17:52,356 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 21:17:52,356 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 21:17:52,356 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 21:17:52,356 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 21:17:52,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 21:17:52,403 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 21:17:52,407 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 21:17:52,408 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 21:17:52,408 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 21:17:52,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,724 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5f1455f60 [2018-04-09 21:17:52,892 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 21:17:52,892 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 21:17:52,892 INFO L168 CDTParser]: Scanning tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,902 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 21:17:52,903 INFO L215 ultiparseSymbolTable]: [2018-04-09 21:17:52,903 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 21:17:52,903 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,903 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 21:17:52,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ssize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____mode_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____socklen_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__gid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ldiv_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_short in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____time_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ino_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__timer_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__mode_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_short in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____nlink_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____timer_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____id_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fd_mask in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__nlink_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____qaddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blksize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____rlim64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____useconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__loff_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__uint in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ssize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____swblk_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__register_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__sigset_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__dev_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__id_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_int in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__time_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____off_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____gid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__daddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ino64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__clock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____pid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ino_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ushort in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fd_mask in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_long in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ulong in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__clockid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__suseconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____daddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____loff_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____clock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__blksize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_char in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fd_set in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__wchar_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__uid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__lldiv_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____dev_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____off64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____suseconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____caddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__caddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_char in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____rlim_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__blkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____sigset_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____clockid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____pthread_list_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__size_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__off_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____intptr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__div_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_long in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_once_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:52,932 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5f1455f60 [2018-04-09 21:17:52,936 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 21:17:52,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 21:17:52,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 21:17:52,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 21:17:52,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 21:17:52,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:17:52" (1/1) ... [2018-04-09 21:17:52,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee7df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:52, skipping insertion in model container [2018-04-09 21:17:52,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:17:52" (1/1) ... [2018-04-09 21:17:52,961 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:17:52,994 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:17:53,164 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:17:53,219 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:17:53,226 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-09 21:17:53,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53 WrapperNode [2018-04-09 21:17:53,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 21:17:53,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 21:17:53,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 21:17:53,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 21:17:53,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... [2018-04-09 21:17:53,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... [2018-04-09 21:17:53,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... [2018-04-09 21:17:53,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... [2018-04-09 21:17:53,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... [2018-04-09 21:17:53,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... [2018-04-09 21:17:53,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... [2018-04-09 21:17:53,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 21:17:53,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 21:17:53,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 21:17:53,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 21:17:53,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:17:53,460 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 21:17:53,460 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 21:17:53,461 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 21:17:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 21:17:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 21:17:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 21:17:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 21:17:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 21:17:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 21:17:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 21:17:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 21:17:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 21:17:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 21:17:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 21:17:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 21:17:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 21:17:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 21:17:53,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 21:17:53,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 21:17:53,463 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 21:17:53,463 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 21:17:53,463 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 21:17:53,463 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 21:17:53,464 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 21:17:53,464 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 21:17:53,464 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 21:17:53,464 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 21:17:53,464 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 21:17:53,464 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 21:17:53,464 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 21:17:53,465 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 21:17:53,466 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 21:17:53,467 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 21:17:53,468 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 21:17:53,469 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 21:17:53,470 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 21:17:53,471 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 21:17:53,472 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 21:17:53,473 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 21:17:53,473 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 21:17:53,473 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 21:17:53,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 21:17:53,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 21:17:53,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 21:17:54,087 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 21:17:54,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:17:54 BoogieIcfgContainer [2018-04-09 21:17:54,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 21:17:54,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 21:17:54,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 21:17:54,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 21:17:54,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 09:17:52" (1/3) ... [2018-04-09 21:17:54,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6ebd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:17:54, skipping insertion in model container [2018-04-09 21:17:54,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:17:53" (2/3) ... [2018-04-09 21:17:54,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6ebd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:17:54, skipping insertion in model container [2018-04-09 21:17:54,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:17:54" (3/3) ... [2018-04-09 21:17:54,094 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-09 21:17:54,101 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 21:17:54,109 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-04-09 21:17:54,150 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 21:17:54,151 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 21:17:54,151 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 21:17:54,151 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 21:17:54,151 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 21:17:54,151 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 21:17:54,151 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 21:17:54,151 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 21:17:54,151 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 21:17:54,152 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 21:17:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-04-09 21:17:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-09 21:17:54,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:54,176 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:54,176 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2047924370, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:54,191 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:54,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:54,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:17:54,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:54,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:54,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:17:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:54,313 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:54,358 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:54,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:54,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:17:54,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:17:54,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:17:54,372 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-04-09 21:17:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:54,636 INFO L93 Difference]: Finished difference Result 424 states and 452 transitions. [2018-04-09 21:17:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:17:54,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-04-09 21:17:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:54,651 INFO L225 Difference]: With dead ends: 424 [2018-04-09 21:17:54,651 INFO L226 Difference]: Without dead ends: 225 [2018-04-09 21:17:54,656 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:17:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-09 21:17:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 204. [2018-04-09 21:17:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-09 21:17:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-04-09 21:17:54,705 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 10 [2018-04-09 21:17:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:54,706 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-04-09 21:17:54,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:17:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-04-09 21:17:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-09 21:17:54,707 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:54,707 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:54,707 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2047924369, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:54,714 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:54,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:54,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:17:54,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:54,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:54,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:17:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:54,774 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:54,850 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:54,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:17:54,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:17:54,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:17:54,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:17:54,853 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 6 states. [2018-04-09 21:17:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:55,176 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2018-04-09 21:17:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:17:55,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-04-09 21:17:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:55,180 INFO L225 Difference]: With dead ends: 244 [2018-04-09 21:17:55,180 INFO L226 Difference]: Without dead ends: 241 [2018-04-09 21:17:55,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:17:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-09 21:17:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 201. [2018-04-09 21:17:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-09 21:17:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2018-04-09 21:17:55,196 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 10 [2018-04-09 21:17:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:55,199 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2018-04-09 21:17:55,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:17:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2018-04-09 21:17:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 21:17:55,200 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:55,201 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-09 21:17:55,201 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -617344532, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:55,209 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:55,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:55,248 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:55,287 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:55,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:55,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:17:55,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:17:55,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:17:55,288 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 4 states. [2018-04-09 21:17:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:55,537 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-04-09 21:17:55,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:17:55,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-09 21:17:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:55,539 INFO L225 Difference]: With dead ends: 233 [2018-04-09 21:17:55,539 INFO L226 Difference]: Without dead ends: 215 [2018-04-09 21:17:55,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:17:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-09 21:17:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 186. [2018-04-09 21:17:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-09 21:17:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2018-04-09 21:17:55,553 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 19 [2018-04-09 21:17:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:55,554 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2018-04-09 21:17:55,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:17:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2018-04-09 21:17:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 21:17:55,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:55,555 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-09 21:17:55,555 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash -617344531, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:55,565 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:55,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:55,602 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:55,631 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:55,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:55,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:17:55,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:17:55,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:17:55,632 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2018-04-09 21:17:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:55,801 INFO L93 Difference]: Finished difference Result 284 states and 307 transitions. [2018-04-09 21:17:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:17:55,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-09 21:17:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:55,802 INFO L225 Difference]: With dead ends: 284 [2018-04-09 21:17:55,802 INFO L226 Difference]: Without dead ends: 278 [2018-04-09 21:17:55,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:17:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-09 21:17:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 229. [2018-04-09 21:17:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-09 21:17:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 253 transitions. [2018-04-09 21:17:55,817 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 253 transitions. Word has length 19 [2018-04-09 21:17:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:55,817 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 253 transitions. [2018-04-09 21:17:55,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:17:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 253 transitions. [2018-04-09 21:17:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 21:17:55,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:55,818 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:55,818 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1130830182, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:55,826 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:55,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:55,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:17:55,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:55,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:55,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:17:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:55,854 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:55,881 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:55,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:55,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:17:55,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:17:55,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:17:55,882 INFO L87 Difference]: Start difference. First operand 229 states and 253 transitions. Second operand 4 states. [2018-04-09 21:17:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:55,990 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2018-04-09 21:17:55,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:17:55,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-09 21:17:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:55,992 INFO L225 Difference]: With dead ends: 250 [2018-04-09 21:17:55,992 INFO L226 Difference]: Without dead ends: 247 [2018-04-09 21:17:55,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:17:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-09 21:17:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2018-04-09 21:17:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-09 21:17:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 257 transitions. [2018-04-09 21:17:56,002 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 257 transitions. Word has length 21 [2018-04-09 21:17:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:56,002 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 257 transitions. [2018-04-09 21:17:56,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:17:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 257 transitions. [2018-04-09 21:17:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 21:17:56,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:56,003 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:56,003 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:56,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1130830183, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:56,009 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:56,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:56,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:17:56,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:56,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:56,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:17:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,061 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,099 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:56,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:17:56,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:17:56,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:17:56,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:17:56,100 INFO L87 Difference]: Start difference. First operand 231 states and 257 transitions. Second operand 6 states. [2018-04-09 21:17:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:56,256 INFO L93 Difference]: Finished difference Result 236 states and 260 transitions. [2018-04-09 21:17:56,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:17:56,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-09 21:17:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:56,258 INFO L225 Difference]: With dead ends: 236 [2018-04-09 21:17:56,258 INFO L226 Difference]: Without dead ends: 233 [2018-04-09 21:17:56,259 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:17:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-09 21:17:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2018-04-09 21:17:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-09 21:17:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2018-04-09 21:17:56,266 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 21 [2018-04-09 21:17:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:56,266 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2018-04-09 21:17:56,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:17:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2018-04-09 21:17:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-09 21:17:56,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:56,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] [2018-04-09 21:17:56,267 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:56,267 INFO L82 PathProgramCache]: Analyzing trace with hash -260984291, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:56,273 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:56,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,301 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,348 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:56,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 21:17:56,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:17:56,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:17:56,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:17:56,349 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand 8 states. [2018-04-09 21:17:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:56,702 INFO L93 Difference]: Finished difference Result 377 states and 417 transitions. [2018-04-09 21:17:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 21:17:56,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-09 21:17:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:56,705 INFO L225 Difference]: With dead ends: 377 [2018-04-09 21:17:56,705 INFO L226 Difference]: Without dead ends: 371 [2018-04-09 21:17:56,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:17:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-09 21:17:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 271. [2018-04-09 21:17:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-09 21:17:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2018-04-09 21:17:56,718 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 22 [2018-04-09 21:17:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:56,719 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2018-04-09 21:17:56,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:17:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2018-04-09 21:17:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 21:17:56,719 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:56,719 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] [2018-04-09 21:17:56,720 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 624757150, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:56,725 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:56,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,808 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:56,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:17:56,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:17:56,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:17:56,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:17:56,809 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand 4 states. [2018-04-09 21:17:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:56,836 INFO L93 Difference]: Finished difference Result 275 states and 308 transitions. [2018-04-09 21:17:56,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:17:56,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-09 21:17:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:56,838 INFO L225 Difference]: With dead ends: 275 [2018-04-09 21:17:56,838 INFO L226 Difference]: Without dead ends: 272 [2018-04-09 21:17:56,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:17:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-09 21:17:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-04-09 21:17:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-09 21:17:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 304 transitions. [2018-04-09 21:17:56,850 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 304 transitions. Word has length 26 [2018-04-09 21:17:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:56,851 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 304 transitions. [2018-04-09 21:17:56,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:17:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 304 transitions. [2018-04-09 21:17:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-09 21:17:56,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:56,852 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:56,852 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2035756721, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:56,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:56,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,901 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:56,948 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:56,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:56,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:17:56,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:17:56,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:17:56,949 INFO L87 Difference]: Start difference. First operand 271 states and 304 transitions. Second operand 4 states. [2018-04-09 21:17:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:57,056 INFO L93 Difference]: Finished difference Result 296 states and 331 transitions. [2018-04-09 21:17:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:17:57,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-09 21:17:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:57,058 INFO L225 Difference]: With dead ends: 296 [2018-04-09 21:17:57,058 INFO L226 Difference]: Without dead ends: 292 [2018-04-09 21:17:57,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:17:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-09 21:17:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 271. [2018-04-09 21:17:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-09 21:17:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2018-04-09 21:17:57,072 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 29 [2018-04-09 21:17:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:57,072 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2018-04-09 21:17:57,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:17:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2018-04-09 21:17:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-09 21:17:57,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:57,074 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:57,074 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2035756722, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:57,083 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:57,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:57,119 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:57,163 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:57,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:57,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:17:57,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:17:57,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:17:57,164 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand 4 states. [2018-04-09 21:17:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:57,367 INFO L93 Difference]: Finished difference Result 295 states and 330 transitions. [2018-04-09 21:17:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:17:57,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-09 21:17:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:57,368 INFO L225 Difference]: With dead ends: 295 [2018-04-09 21:17:57,369 INFO L226 Difference]: Without dead ends: 294 [2018-04-09 21:17:57,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:17:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-09 21:17:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 284. [2018-04-09 21:17:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-09 21:17:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-04-09 21:17:57,381 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 29 [2018-04-09 21:17:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:57,381 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-04-09 21:17:57,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:17:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-04-09 21:17:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 21:17:57,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:57,382 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:57,383 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2004531740, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:57,391 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:57,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:57,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-09 21:17:57,451 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:57,489 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:57,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:17:57,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:17:57,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:17:57,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:17:57,490 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 6 states. [2018-04-09 21:17:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:57,625 INFO L93 Difference]: Finished difference Result 315 states and 357 transitions. [2018-04-09 21:17:57,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:17:57,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-09 21:17:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:57,627 INFO L225 Difference]: With dead ends: 315 [2018-04-09 21:17:57,627 INFO L226 Difference]: Without dead ends: 314 [2018-04-09 21:17:57,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:17:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-09 21:17:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 287. [2018-04-09 21:17:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-09 21:17:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 327 transitions. [2018-04-09 21:17:57,642 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 327 transitions. Word has length 32 [2018-04-09 21:17:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:57,643 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 327 transitions. [2018-04-09 21:17:57,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:17:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 327 transitions. [2018-04-09 21:17:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-09 21:17:57,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:57,647 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] [2018-04-09 21:17:57,647 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:57,648 INFO L82 PathProgramCache]: Analyzing trace with hash -647063994, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:57,662 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:57,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:57,704 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:57,763 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:57,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:57,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:17:57,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:17:57,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:17:57,764 INFO L87 Difference]: Start difference. First operand 287 states and 327 transitions. Second operand 3 states. [2018-04-09 21:17:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:57,785 INFO L93 Difference]: Finished difference Result 548 states and 626 transitions. [2018-04-09 21:17:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:17:57,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-04-09 21:17:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:57,787 INFO L225 Difference]: With dead ends: 548 [2018-04-09 21:17:57,788 INFO L226 Difference]: Without dead ends: 273 [2018-04-09 21:17:57,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-09 21:17:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-09 21:17:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-04-09 21:17:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-09 21:17:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 308 transitions. [2018-04-09 21:17:57,799 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 308 transitions. Word has length 33 [2018-04-09 21:17:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:57,799 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 308 transitions. [2018-04-09 21:17:57,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:17:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 308 transitions. [2018-04-09 21:17:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 21:17:57,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:57,801 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:17:57,801 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1911115097, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:57,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:57,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:57,839 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:57,880 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:57,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:17:57,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:17:57,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:17:57,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:17:57,881 INFO L87 Difference]: Start difference. First operand 273 states and 308 transitions. Second operand 3 states. [2018-04-09 21:17:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:57,897 INFO L93 Difference]: Finished difference Result 472 states and 531 transitions. [2018-04-09 21:17:57,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:17:57,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-04-09 21:17:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:57,898 INFO L225 Difference]: With dead ends: 472 [2018-04-09 21:17:57,898 INFO L226 Difference]: Without dead ends: 277 [2018-04-09 21:17:57,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-09 21:17:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-09 21:17:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-04-09 21:17:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-04-09 21:17:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 312 transitions. [2018-04-09 21:17:57,906 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 312 transitions. Word has length 34 [2018-04-09 21:17:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:57,906 INFO L459 AbstractCegarLoop]: Abstraction has 277 states and 312 transitions. [2018-04-09 21:17:57,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:17:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 312 transitions. [2018-04-09 21:17:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-09 21:17:57,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:57,907 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] [2018-04-09 21:17:57,907 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash 220461557, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:57,914 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:57,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:57,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:17:57,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:17:57,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:17:57,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:57,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:57,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 21:17:58,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:17:58,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:17:58,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:58,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:58,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:58,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-09 21:17:58,065 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 31 treesize of output 25 [2018-04-09 21:17:58,068 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 25 treesize of output 10 [2018-04-09 21:17:58,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:58,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:58,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:58,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-04-09 21:17:58,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:17:58,127 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 15 [2018-04-09 21:17:58,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:58,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:17:58,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-09 21:17:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:58,162 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:58,339 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:58,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-09 21:17:58,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 21:17:58,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 21:17:58,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:17:58,341 INFO L87 Difference]: Start difference. First operand 277 states and 312 transitions. Second operand 18 states. [2018-04-09 21:17:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:17:59,381 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2018-04-09 21:17:59,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-09 21:17:59,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-04-09 21:17:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:17:59,383 INFO L225 Difference]: With dead ends: 306 [2018-04-09 21:17:59,383 INFO L226 Difference]: Without dead ends: 305 [2018-04-09 21:17:59,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-04-09 21:17:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-09 21:17:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 280. [2018-04-09 21:17:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-09 21:17:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 316 transitions. [2018-04-09 21:17:59,395 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 316 transitions. Word has length 35 [2018-04-09 21:17:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:17:59,396 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 316 transitions. [2018-04-09 21:17:59,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 21:17:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 316 transitions. [2018-04-09 21:17:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-09 21:17:59,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:17:59,397 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] [2018-04-09 21:17:59,397 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:17:59,397 INFO L82 PathProgramCache]: Analyzing trace with hash 220461558, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:17:59,407 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:17:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:17:59,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:17:59,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:17:59,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:17:59,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:17:59,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:17:59,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:17:59,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-09 21:17:59,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:17:59,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:17:59,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:17:59,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:17:59,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2018-04-09 21:17:59,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-09 21:17:59,576 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 33 treesize of output 18 [2018-04-09 21:17:59,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-09 21:17:59,589 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 26 treesize of output 11 [2018-04-09 21:17:59,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:17:59,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:17:59,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2018-04-09 21:17:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:59,633 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:17:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:17:59,804 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:17:59,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2018-04-09 21:17:59,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:17:59,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:17:59,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:17:59,805 INFO L87 Difference]: Start difference. First operand 280 states and 316 transitions. Second operand 15 states. [2018-04-09 21:18:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:00,730 INFO L93 Difference]: Finished difference Result 433 states and 478 transitions. [2018-04-09 21:18:00,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 21:18:00,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-09 21:18:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:00,732 INFO L225 Difference]: With dead ends: 433 [2018-04-09 21:18:00,732 INFO L226 Difference]: Without dead ends: 431 [2018-04-09 21:18:00,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2018-04-09 21:18:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-09 21:18:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 280. [2018-04-09 21:18:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-09 21:18:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 314 transitions. [2018-04-09 21:18:00,742 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 314 transitions. Word has length 35 [2018-04-09 21:18:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:00,742 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 314 transitions. [2018-04-09 21:18:00,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:18:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 314 transitions. [2018-04-09 21:18:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-09 21:18:00,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:00,743 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] [2018-04-09 21:18:00,743 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:00,743 INFO L82 PathProgramCache]: Analyzing trace with hash 812735587, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:00,752 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:00,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:00,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:00,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:00,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:00,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:00,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-09 21:18:00,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:18:00,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:18:00,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:18:00,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:18:00,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-09 21:18:00,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:18:00,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 21:18:00,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:18:00,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:00,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 21:18:00,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:00,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-09 21:18:01,016 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 33 treesize of output 25 [2018-04-09 21:18:01,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-09 21:18:01,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-09 21:18:01,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-09 21:18:01,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:7 [2018-04-09 21:18:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:01,095 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:01,147 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:01,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 9 [2018-04-09 21:18:01,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:18:01,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:18:01,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:18:01,148 INFO L87 Difference]: Start difference. First operand 280 states and 314 transitions. Second operand 9 states. [2018-04-09 21:18:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:01,468 INFO L93 Difference]: Finished difference Result 552 states and 612 transitions. [2018-04-09 21:18:01,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 21:18:01,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-04-09 21:18:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:01,470 INFO L225 Difference]: With dead ends: 552 [2018-04-09 21:18:01,470 INFO L226 Difference]: Without dead ends: 284 [2018-04-09 21:18:01,471 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:18:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-09 21:18:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 244. [2018-04-09 21:18:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-09 21:18:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-04-09 21:18:01,477 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 35 [2018-04-09 21:18:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:01,477 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-04-09 21:18:01,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:18:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-04-09 21:18:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 21:18:01,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:01,477 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:18:01,478 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash -987216796, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:01,483 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:01,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:01,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:18:01,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:01,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:18:01,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:01,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-09 21:18:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:01,550 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:01,633 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:01,634 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2018-04-09 21:18:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:01,663 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:01,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-09 21:18:01,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 21:18:01,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 21:18:01,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:18:01,664 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 10 states. [2018-04-09 21:18:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:01,913 INFO L93 Difference]: Finished difference Result 272 states and 300 transitions. [2018-04-09 21:18:01,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 21:18:01,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-09 21:18:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:01,915 INFO L225 Difference]: With dead ends: 272 [2018-04-09 21:18:01,915 INFO L226 Difference]: Without dead ends: 270 [2018-04-09 21:18:01,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:18:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-09 21:18:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 242. [2018-04-09 21:18:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-09 21:18:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 266 transitions. [2018-04-09 21:18:01,924 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 266 transitions. Word has length 36 [2018-04-09 21:18:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:01,924 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 266 transitions. [2018-04-09 21:18:01,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 21:18:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2018-04-09 21:18:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 21:18:01,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:01,925 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] [2018-04-09 21:18:01,925 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash 765456575, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:01,935 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:01,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:01,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 20 [2018-04-09 21:18:01,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:01,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:01,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:23 [2018-04-09 21:18:02,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-09 21:18:02,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:18:02,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-04-09 21:18:02,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:18:02,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-04-09 21:18:02,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:18:02,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,069 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-04-09 21:18:02,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:18:02,083 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,087 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:02,097 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:72, output treesize:41 [2018-04-09 21:18:02,124 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 33 treesize of output 29 [2018-04-09 21:18:02,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 21:18:02,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-09 21:18:02,142 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 7 treesize of output 3 [2018-04-09 21:18:02,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,154 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 43 treesize of output 39 [2018-04-09 21:18:02,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-04-09 21:18:02,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,169 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 28 treesize of output 24 [2018-04-09 21:18:02,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-09 21:18:02,171 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,174 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:02,180 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:77, output treesize:23 [2018-04-09 21:18:02,208 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 19 treesize of output 18 [2018-04-09 21:18:02,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:18:02,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:18:02,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:30 [2018-04-09 21:18:02,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:02,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:02,248 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 26 treesize of output 20 [2018-04-09 21:18:02,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:02,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2018-04-09 21:18:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:02,281 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:02,321 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 10 treesize of output 3 [2018-04-09 21:18:02,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:02,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-09 21:18:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:06,511 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:06,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-09 21:18:06,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 21:18:06,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 21:18:06,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=325, Unknown=3, NotChecked=0, Total=380 [2018-04-09 21:18:06,513 INFO L87 Difference]: Start difference. First operand 242 states and 266 transitions. Second operand 20 states. [2018-04-09 21:18:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:07,772 INFO L93 Difference]: Finished difference Result 347 states and 376 transitions. [2018-04-09 21:18:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 21:18:07,805 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-04-09 21:18:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:07,807 INFO L225 Difference]: With dead ends: 347 [2018-04-09 21:18:07,807 INFO L226 Difference]: Without dead ends: 346 [2018-04-09 21:18:07,808 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=190, Invalid=929, Unknown=3, NotChecked=0, Total=1122 [2018-04-09 21:18:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-09 21:18:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 265. [2018-04-09 21:18:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-09 21:18:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 290 transitions. [2018-04-09 21:18:07,826 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 290 transitions. Word has length 38 [2018-04-09 21:18:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:07,827 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 290 transitions. [2018-04-09 21:18:07,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 21:18:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 290 transitions. [2018-04-09 21:18:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 21:18:07,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:07,828 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] [2018-04-09 21:18:07,828 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash 472432838, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:07,841 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:07,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:07,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:07,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:18:07,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:07,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:07,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 21:18:07,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:18:07,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 21:18:07,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:07,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 21:18:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:07,899 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:07,923 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:07,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:18:07,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:18:07,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:18:07,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:18:07,924 INFO L87 Difference]: Start difference. First operand 265 states and 290 transitions. Second operand 5 states. [2018-04-09 21:18:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:08,081 INFO L93 Difference]: Finished difference Result 377 states and 412 transitions. [2018-04-09 21:18:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:18:08,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-09 21:18:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:08,083 INFO L225 Difference]: With dead ends: 377 [2018-04-09 21:18:08,083 INFO L226 Difference]: Without dead ends: 376 [2018-04-09 21:18:08,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:18:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-04-09 21:18:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 264. [2018-04-09 21:18:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-09 21:18:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 289 transitions. [2018-04-09 21:18:08,093 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 289 transitions. Word has length 38 [2018-04-09 21:18:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:08,093 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 289 transitions. [2018-04-09 21:18:08,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:18:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 289 transitions. [2018-04-09 21:18:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 21:18:08,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:08,094 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] [2018-04-09 21:18:08,094 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:08,094 INFO L82 PathProgramCache]: Analyzing trace with hash 472432839, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:08,106 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:08,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:08,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:08,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:18:08,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:08,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:08,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:08,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:08,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-09 21:18:08,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-09 21:18:08,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 21:18:08,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:18:08,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:18:08,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-09 21:18:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:08,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:08,298 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:08,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 21:18:08,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:18:08,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:18:08,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:18:08,299 INFO L87 Difference]: Start difference. First operand 264 states and 289 transitions. Second operand 8 states. [2018-04-09 21:18:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:08,725 INFO L93 Difference]: Finished difference Result 414 states and 451 transitions. [2018-04-09 21:18:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:18:08,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-04-09 21:18:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:08,726 INFO L225 Difference]: With dead ends: 414 [2018-04-09 21:18:08,726 INFO L226 Difference]: Without dead ends: 413 [2018-04-09 21:18:08,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:18:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-09 21:18:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 263. [2018-04-09 21:18:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-09 21:18:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 288 transitions. [2018-04-09 21:18:08,736 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 288 transitions. Word has length 38 [2018-04-09 21:18:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:08,736 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 288 transitions. [2018-04-09 21:18:08,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:18:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 288 transitions. [2018-04-09 21:18:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 21:18:08,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:08,737 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:18:08,737 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1149096942, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:08,745 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:08,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:08,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:08,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:18:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:08,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:08,794 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:08,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:18:08,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:18:08,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:18:08,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:18:08,794 INFO L87 Difference]: Start difference. First operand 263 states and 288 transitions. Second operand 4 states. [2018-04-09 21:18:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:08,880 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-04-09 21:18:08,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:18:08,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-04-09 21:18:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:08,881 INFO L225 Difference]: With dead ends: 281 [2018-04-09 21:18:08,881 INFO L226 Difference]: Without dead ends: 280 [2018-04-09 21:18:08,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:18:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-09 21:18:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2018-04-09 21:18:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-09 21:18:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 287 transitions. [2018-04-09 21:18:08,891 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 287 transitions. Word has length 40 [2018-04-09 21:18:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:08,892 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 287 transitions. [2018-04-09 21:18:08,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:18:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 287 transitions. [2018-04-09 21:18:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 21:18:08,892 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:08,893 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:18:08,893 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1149096943, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:08,906 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:08,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:08,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:08,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:08,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:18:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:08,945 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:08,994 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:08,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:18:08,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:18:08,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:18:08,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:18:08,995 INFO L87 Difference]: Start difference. First operand 262 states and 287 transitions. Second operand 6 states. [2018-04-09 21:18:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:09,132 INFO L93 Difference]: Finished difference Result 341 states and 368 transitions. [2018-04-09 21:18:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:18:09,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-09 21:18:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:09,134 INFO L225 Difference]: With dead ends: 341 [2018-04-09 21:18:09,134 INFO L226 Difference]: Without dead ends: 339 [2018-04-09 21:18:09,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:18:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-09 21:18:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 260. [2018-04-09 21:18:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-09 21:18:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2018-04-09 21:18:09,146 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 40 [2018-04-09 21:18:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:09,147 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2018-04-09 21:18:09,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:18:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2018-04-09 21:18:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 21:18:09,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:09,148 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] [2018-04-09 21:18:09,148 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1735652972, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:09,168 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:09,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:09,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:18:09,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:18:09,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-04-09 21:18:09,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 21:18:09,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 21:18:09,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-09 21:18:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:09,219 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:09,247 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:09,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-09 21:18:09,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:18:09,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:18:09,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:18:09,248 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 8 states. [2018-04-09 21:18:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:09,432 INFO L93 Difference]: Finished difference Result 433 states and 476 transitions. [2018-04-09 21:18:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:18:09,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-04-09 21:18:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:09,434 INFO L225 Difference]: With dead ends: 433 [2018-04-09 21:18:09,434 INFO L226 Difference]: Without dead ends: 432 [2018-04-09 21:18:09,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:18:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-04-09 21:18:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 286. [2018-04-09 21:18:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-09 21:18:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 320 transitions. [2018-04-09 21:18:09,446 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 320 transitions. Word has length 41 [2018-04-09 21:18:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:09,446 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 320 transitions. [2018-04-09 21:18:09,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:18:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2018-04-09 21:18:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 21:18:09,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:09,447 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] [2018-04-09 21:18:09,447 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:09,448 INFO L82 PathProgramCache]: Analyzing trace with hash -361073652, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:09,456 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:09,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:09,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:09,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:09,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:18:09,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 21:18:09,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:09,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:09,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-09 21:18:09,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-09 21:18:09,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:18:09,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:09,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-09 21:18:09,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-09 21:18:09,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-09 21:18:09,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:18:09,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:09,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-09 21:18:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:09,576 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:09,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-09 21:18:09,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:09,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,650 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-09 21:18:09,652 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 14 treesize of output 5 [2018-04-09 21:18:09,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,655 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-09 21:18:09,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:18:09,657 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:09,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:18:09,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:18:09,686 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2018-04-09 21:18:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:09,750 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:09,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-09 21:18:09,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 21:18:09,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 21:18:09,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:18:09,751 INFO L87 Difference]: Start difference. First operand 286 states and 320 transitions. Second operand 16 states. [2018-04-09 21:18:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:10,199 INFO L93 Difference]: Finished difference Result 344 states and 382 transitions. [2018-04-09 21:18:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:18:10,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-09 21:18:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:10,200 INFO L225 Difference]: With dead ends: 344 [2018-04-09 21:18:10,200 INFO L226 Difference]: Without dead ends: 343 [2018-04-09 21:18:10,201 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:18:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-09 21:18:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 285. [2018-04-09 21:18:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-09 21:18:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 319 transitions. [2018-04-09 21:18:10,209 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 319 transitions. Word has length 41 [2018-04-09 21:18:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:10,209 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 319 transitions. [2018-04-09 21:18:10,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 21:18:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 319 transitions. [2018-04-09 21:18:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 21:18:10,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:10,210 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] [2018-04-09 21:18:10,210 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash -361073651, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:10,219 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:10,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:10,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:10,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:10,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:10,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:18:10,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 21:18:10,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:10,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:10,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:10,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:10,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-09 21:18:10,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-09 21:18:10,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:18:10,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-09 21:18:10,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:18:10,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:10,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-09 21:18:10,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-09 21:18:10,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:18:10,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-09 21:18:10,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-09 21:18:10,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:18:10,458 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:18:10,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,469 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-09 21:18:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:10,479 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:10,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-09 21:18:10,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:10,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,685 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-09 21:18:10,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:18:10,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,692 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 48 treesize of output 44 [2018-04-09 21:18:10,694 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 44 treesize of output 35 [2018-04-09 21:18:10,694 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,696 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:18:10,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-09 21:18:10,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:10,746 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-09 21:18:10,753 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 16 treesize of output 7 [2018-04-09 21:18:10,753 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,755 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,758 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-09 21:18:10,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:10,776 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-09 21:18:10,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-09 21:18:10,782 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,784 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,786 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-04-09 21:18:10,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:10,801 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,807 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 8 treesize of output 6 [2018-04-09 21:18:10,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:18:10,809 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,810 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,813 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-09 21:18:10,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:10,845 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,850 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-09 21:18:10,852 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 14 treesize of output 5 [2018-04-09 21:18:10,852 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,853 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,856 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:10,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 21:18:10,872 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:97, output treesize:43 [2018-04-09 21:18:10,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 21:18:10,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:10,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-09 21:18:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:10,951 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:10,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-09 21:18:10,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 21:18:10,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 21:18:10,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:18:10,951 INFO L87 Difference]: Start difference. First operand 285 states and 319 transitions. Second operand 16 states. [2018-04-09 21:18:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:11,373 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2018-04-09 21:18:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:18:11,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-09 21:18:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:11,374 INFO L225 Difference]: With dead ends: 331 [2018-04-09 21:18:11,375 INFO L226 Difference]: Without dead ends: 330 [2018-04-09 21:18:11,375 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:18:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-09 21:18:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 284. [2018-04-09 21:18:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-09 21:18:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 318 transitions. [2018-04-09 21:18:11,386 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 318 transitions. Word has length 41 [2018-04-09 21:18:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:11,386 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 318 transitions. [2018-04-09 21:18:11,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 21:18:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 318 transitions. [2018-04-09 21:18:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 21:18:11,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:11,388 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] [2018-04-09 21:18:11,388 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1145419178, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:11,397 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:11,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:11,418 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:11,449 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:11,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:18:11,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:18:11,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:18:11,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:18:11,450 INFO L87 Difference]: Start difference. First operand 284 states and 318 transitions. Second operand 3 states. [2018-04-09 21:18:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:11,465 INFO L93 Difference]: Finished difference Result 503 states and 567 transitions. [2018-04-09 21:18:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:18:11,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-04-09 21:18:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:11,467 INFO L225 Difference]: With dead ends: 503 [2018-04-09 21:18:11,468 INFO L226 Difference]: Without dead ends: 286 [2018-04-09 21:18:11,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-09 21:18:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-09 21:18:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-04-09 21:18:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-09 21:18:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 320 transitions. [2018-04-09 21:18:11,478 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 320 transitions. Word has length 41 [2018-04-09 21:18:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:11,478 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 320 transitions. [2018-04-09 21:18:11,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:18:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2018-04-09 21:18:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 21:18:11,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:11,479 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] [2018-04-09 21:18:11,479 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1499933917, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:11,487 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:11,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:11,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:11,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:11,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:11,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:18:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:11,516 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:11,544 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:11,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:18:11,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:18:11,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:18:11,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:18:11,545 INFO L87 Difference]: Start difference. First operand 286 states and 320 transitions. Second operand 4 states. [2018-04-09 21:18:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:11,691 INFO L93 Difference]: Finished difference Result 299 states and 331 transitions. [2018-04-09 21:18:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:18:11,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-04-09 21:18:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:11,693 INFO L225 Difference]: With dead ends: 299 [2018-04-09 21:18:11,693 INFO L226 Difference]: Without dead ends: 298 [2018-04-09 21:18:11,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:18:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-09 21:18:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 285. [2018-04-09 21:18:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-09 21:18:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 318 transitions. [2018-04-09 21:18:11,700 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 318 transitions. Word has length 43 [2018-04-09 21:18:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:11,700 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 318 transitions. [2018-04-09 21:18:11,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:18:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 318 transitions. [2018-04-09 21:18:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 21:18:11,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:11,701 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] [2018-04-09 21:18:11,701 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1499933918, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:11,708 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:11,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:11,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:11,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:11,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:11,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:18:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:11,772 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:11,817 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:11,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:18:11,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:18:11,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:18:11,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:18:11,818 INFO L87 Difference]: Start difference. First operand 285 states and 318 transitions. Second operand 6 states. [2018-04-09 21:18:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:11,983 INFO L93 Difference]: Finished difference Result 368 states and 404 transitions. [2018-04-09 21:18:11,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:18:11,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-04-09 21:18:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:11,985 INFO L225 Difference]: With dead ends: 368 [2018-04-09 21:18:11,985 INFO L226 Difference]: Without dead ends: 366 [2018-04-09 21:18:11,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:18:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-09 21:18:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 283. [2018-04-09 21:18:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-09 21:18:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2018-04-09 21:18:11,995 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 43 [2018-04-09 21:18:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:11,996 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2018-04-09 21:18:11,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:18:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2018-04-09 21:18:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 21:18:11,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:11,997 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] [2018-04-09 21:18:11,997 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1415407417, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:12,005 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:12,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:12,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:18:12,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:18:12,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:18:12,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:18:12,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 21:18:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:12,065 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:12,123 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:12,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2018-04-09 21:18:12,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:18:12,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:18:12,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:18:12,123 INFO L87 Difference]: Start difference. First operand 283 states and 314 transitions. Second operand 9 states. [2018-04-09 21:18:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:12,360 INFO L93 Difference]: Finished difference Result 602 states and 668 transitions. [2018-04-09 21:18:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:18:12,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-09 21:18:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:12,361 INFO L225 Difference]: With dead ends: 602 [2018-04-09 21:18:12,361 INFO L226 Difference]: Without dead ends: 331 [2018-04-09 21:18:12,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:18:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-09 21:18:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 281. [2018-04-09 21:18:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-09 21:18:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 310 transitions. [2018-04-09 21:18:12,368 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 310 transitions. Word has length 43 [2018-04-09 21:18:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:12,368 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 310 transitions. [2018-04-09 21:18:12,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:18:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 310 transitions. [2018-04-09 21:18:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-09 21:18:12,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:12,369 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] [2018-04-09 21:18:12,369 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:12,369 INFO L82 PathProgramCache]: Analyzing trace with hash -746688604, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:12,374 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:12,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:12,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:12,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:12,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:18:12,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:18:12,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-09 21:18:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:12,432 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:12,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 21:18:12,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-09 21:18:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:12,527 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:12,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-09 21:18:12,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:18:12,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:18:12,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:18:12,528 INFO L87 Difference]: Start difference. First operand 281 states and 310 transitions. Second operand 9 states. [2018-04-09 21:18:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:12,741 INFO L93 Difference]: Finished difference Result 325 states and 355 transitions. [2018-04-09 21:18:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:18:12,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-09 21:18:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:12,743 INFO L225 Difference]: With dead ends: 325 [2018-04-09 21:18:12,743 INFO L226 Difference]: Without dead ends: 322 [2018-04-09 21:18:12,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:18:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-09 21:18:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 293. [2018-04-09 21:18:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-09 21:18:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 323 transitions. [2018-04-09 21:18:12,751 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 323 transitions. Word has length 44 [2018-04-09 21:18:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:12,752 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 323 transitions. [2018-04-09 21:18:12,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:18:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 323 transitions. [2018-04-09 21:18:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-09 21:18:12,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:12,753 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] [2018-04-09 21:18:12,753 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2146972115, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:12,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:12,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:12,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:12,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:12,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:18:12,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 21:18:12,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:12,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:12,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-09 21:18:12,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-09 21:18:12,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:18:12,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:12,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-09 21:18:12,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-09 21:18:12,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-09 21:18:12,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:12,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:12,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-04-09 21:18:18,963 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-04-09 21:18:18,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-09 21:18:18,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:18:18,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:18,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-09 21:18:18,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:18,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:18,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:18,980 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-09 21:18:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:18,994 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:23,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 69 [2018-04-09 21:18:23,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:23,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 58 [2018-04-09 21:18:23,236 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 30 treesize of output 29 [2018-04-09 21:18:23,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2018-04-09 21:18:23,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:23,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2018-04-09 21:18:23,299 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:23,360 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 34 treesize of output 34 [2018-04-09 21:18:23,361 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 22 treesize of output 14 [2018-04-09 21:18:23,362 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2018-04-09 21:18:23,375 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:23,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:18:23,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:23,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-09 21:18:23,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-04-09 21:18:23,390 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,392 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:23,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-04-09 21:18:23,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 21:18:23,400 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:23,410 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:23,466 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-09 21:18:23,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-09 21:18:23,468 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,471 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:18:23,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:18:23,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:18:23,540 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 4 variables, input treesize:123, output treesize:25 [2018-04-09 21:18:23,588 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:23,589 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:21, output treesize:1 [2018-04-09 21:18:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:23,613 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:23,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-09 21:18:23,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 21:18:23,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 21:18:23,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=294, Unknown=4, NotChecked=0, Total=380 [2018-04-09 21:18:23,614 INFO L87 Difference]: Start difference. First operand 293 states and 323 transitions. Second operand 20 states. [2018-04-09 21:18:39,975 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 36 DAG size of output 32 [2018-04-09 21:18:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:46,325 INFO L93 Difference]: Finished difference Result 359 states and 394 transitions. [2018-04-09 21:18:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 21:18:46,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-09 21:18:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:46,326 INFO L225 Difference]: With dead ends: 359 [2018-04-09 21:18:46,326 INFO L226 Difference]: Without dead ends: 358 [2018-04-09 21:18:46,327 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=311, Invalid=800, Unknown=11, NotChecked=0, Total=1122 [2018-04-09 21:18:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-09 21:18:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 292. [2018-04-09 21:18:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-09 21:18:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 321 transitions. [2018-04-09 21:18:46,333 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 321 transitions. Word has length 44 [2018-04-09 21:18:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:46,334 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 321 transitions. [2018-04-09 21:18:46,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 21:18:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 321 transitions. [2018-04-09 21:18:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-09 21:18:46,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:46,334 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] [2018-04-09 21:18:46,334 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2146972114, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:46,340 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:46,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:46,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:18:46,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:46,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:46,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:18:46,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 21:18:46,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:46,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:46,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:18:46,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:18:46,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-09 21:18:46,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-09 21:18:46,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:18:46,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-09 21:18:46,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:18:46,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:46,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-09 21:18:46,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-09 21:18:46,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-09 21:18:46,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,541 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 40 treesize of output 35 [2018-04-09 21:18:46,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-09 21:18:46,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:46,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:46,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-04-09 21:18:50,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-09 21:18:50,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:18:50,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:50,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-09 21:18:50,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:50,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:50,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-09 21:18:50,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:18:50,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:50,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:18:50,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:50,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:50,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:50,639 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-09 21:18:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:50,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:55,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 101 [2018-04-09 21:18:55,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:55,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,603 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 84 treesize of output 78 [2018-04-09 21:18:55,605 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 78 treesize of output 38 [2018-04-09 21:18:55,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 157 [2018-04-09 21:18:55,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:55,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 126 [2018-04-09 21:18:55,786 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 98 DAG size of output 90 [2018-04-09 21:18:55,788 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 102 treesize of output 101 [2018-04-09 21:18:55,789 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 75 [2018-04-09 21:18:55,886 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:55,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 76 [2018-04-09 21:18:55,896 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:55,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-04-09 21:18:55,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:18:55,982 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,988 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 82 treesize of output 40 [2018-04-09 21:18:55,988 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:55,991 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,053 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-04-09 21:18:56,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 49 [2018-04-09 21:18:56,060 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:56,071 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:56,073 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-09 21:18:56,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-04-09 21:18:56,075 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,080 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-09 21:18:56,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 21:18:56,087 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:56,094 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:56,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:18:56,180 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:18:56,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-04-09 21:18:56,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:56,229 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,240 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 35 treesize of output 37 [2018-04-09 21:18:56,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-04-09 21:18:56,259 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:56,259 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:56,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-04-09 21:18:56,260 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,265 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-09 21:18:56,278 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,286 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:56,287 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:56,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-04-09 21:18:56,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:56,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:56,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-09 21:18:56,302 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,306 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,312 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 21:18:56,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-09 21:18:56,315 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,317 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,324 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:18:56,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-04-09 21:18:56,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:56,374 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-09 21:18:56,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-09 21:18:56,380 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,381 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,384 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-04-09 21:18:56,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 10 [2018-04-09 21:18:56,400 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,406 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 30 treesize of output 26 [2018-04-09 21:18:56,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-04-09 21:18:56,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-09 21:18:56,448 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,469 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 20 treesize of output 16 [2018-04-09 21:18:56,469 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-04-09 21:18:56,474 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,476 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,479 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-04-09 21:18:56,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:56,495 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,501 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 28 treesize of output 24 [2018-04-09 21:18:56,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-04-09 21:18:56,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-09 21:18:56,512 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-09 21:18:56,514 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,519 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,520 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,523 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-04-09 21:18:56,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-09 21:18:56,555 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-09 21:18:56,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-09 21:18:56,565 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,566 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,570 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 21:18:56,594 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 10 variables, input treesize:367, output treesize:43 [2018-04-09 21:18:56,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 21:18:56,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-09 21:18:56,664 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:18:56,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:56,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2018-04-09 21:18:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:56,692 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:56,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-09 21:18:56,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 21:18:56,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 21:18:56,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=306, Unknown=4, NotChecked=0, Total=380 [2018-04-09 21:18:56,694 INFO L87 Difference]: Start difference. First operand 292 states and 321 transitions. Second operand 20 states. [2018-04-09 21:18:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:18:57,701 INFO L93 Difference]: Finished difference Result 339 states and 372 transitions. [2018-04-09 21:18:57,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:18:57,701 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-09 21:18:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:18:57,702 INFO L225 Difference]: With dead ends: 339 [2018-04-09 21:18:57,702 INFO L226 Difference]: Without dead ends: 338 [2018-04-09 21:18:57,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=236, Invalid=690, Unknown=4, NotChecked=0, Total=930 [2018-04-09 21:18:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-09 21:18:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 291. [2018-04-09 21:18:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-09 21:18:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 319 transitions. [2018-04-09 21:18:57,712 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 319 transitions. Word has length 44 [2018-04-09 21:18:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:18:57,713 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 319 transitions. [2018-04-09 21:18:57,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 21:18:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 319 transitions. [2018-04-09 21:18:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-09 21:18:57,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:18:57,714 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] [2018-04-09 21:18:57,714 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:18:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1313786845, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:18:57,724 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:18:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:18:57,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:18:57,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:57,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:57,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:18:57,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:18:57,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-04-09 21:18:57,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:18:57,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:18:57,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:18:57,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:18:57,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,800 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:35 [2018-04-09 21:18:57,819 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 39 treesize of output 33 [2018-04-09 21:18:57,821 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 33 treesize of output 18 [2018-04-09 21:18:57,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:18:57,831 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 19 treesize of output 11 [2018-04-09 21:18:57,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:57,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:17 [2018-04-09 21:18:57,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:57,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:57,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:18:57,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,902 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 19 treesize of output 26 [2018-04-09 21:18:57,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:57,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:57,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-04-09 21:18:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:57,955 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:18:58,063 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:18:58,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:58,069 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:58,070 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:58,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-09 21:18:58,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:58,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:18:58,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-04-09 21:18:58,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:18:58,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:18:58,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-04-09 21:18:58,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:18:58,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:18:58,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:58,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:18:58,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:6 [2018-04-09 21:18:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:18:58,317 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:18:58,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 21 [2018-04-09 21:18:58,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-09 21:18:58,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-09 21:18:58,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-09 21:18:58,318 INFO L87 Difference]: Start difference. First operand 291 states and 319 transitions. Second operand 22 states. [2018-04-09 21:19:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:11,872 INFO L93 Difference]: Finished difference Result 394 states and 424 transitions. [2018-04-09 21:19:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-09 21:19:11,872 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-04-09 21:19:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:11,874 INFO L225 Difference]: With dead ends: 394 [2018-04-09 21:19:11,874 INFO L226 Difference]: Without dead ends: 393 [2018-04-09 21:19:11,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 21:19:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-09 21:19:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 268. [2018-04-09 21:19:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-09 21:19:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2018-04-09 21:19:11,882 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 45 [2018-04-09 21:19:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:11,882 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2018-04-09 21:19:11,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-09 21:19:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2018-04-09 21:19:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-09 21:19:11,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:11,883 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] [2018-04-09 21:19:11,883 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1655897451, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:11,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:11,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:11,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:11,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-09 21:19:11,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:11,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:11,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:11,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:19:11,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:11,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:11,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-09 21:19:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:11,952 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:16,016 WARN L148 SmtUtils]: Spent 4033ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-09 21:19:16,045 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:19:16,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,070 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:19:16,070 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:19:16,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-09 21:19:16,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:16,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-04-09 21:19:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:16,144 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:16,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-09 21:19:16,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 21:19:16,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 21:19:16,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:19:16,145 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 10 states. [2018-04-09 21:19:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:16,436 INFO L93 Difference]: Finished difference Result 355 states and 387 transitions. [2018-04-09 21:19:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:19:16,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-04-09 21:19:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:16,438 INFO L225 Difference]: With dead ends: 355 [2018-04-09 21:19:16,438 INFO L226 Difference]: Without dead ends: 354 [2018-04-09 21:19:16,438 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:19:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-09 21:19:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 268. [2018-04-09 21:19:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-09 21:19:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2018-04-09 21:19:16,445 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 46 [2018-04-09 21:19:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:16,445 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2018-04-09 21:19:16,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 21:19:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2018-04-09 21:19:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:19:16,446 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:16,446 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] [2018-04-09 21:19:16,446 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1651166068, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:16,452 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:16,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:16,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:16,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:16,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:41 [2018-04-09 21:19:16,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-09 21:19:16,584 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 42 treesize of output 23 [2018-04-09 21:19:16,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:16,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:23 [2018-04-09 21:19:16,656 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~st~0.base Int) (main_~n~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~0.base 1))) (and (= (store (store .cse0 main_~st~0.base 0) main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0) (= 0 (select .cse0 main_~st~0.base))))) is different from true [2018-04-09 21:19:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-09 21:19:16,670 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:16,789 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc22.base_12| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_12|))) (= (store (store |c_#valid| |v_main_#t~malloc22.base_12| 0) c_main_~root~0.base 0) |c_old(#valid)|))) is different from false [2018-04-09 21:19:16,840 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc22.base_12| Int) (|v_main_#t~malloc0.base_6| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_6| 1))) (or (not (= (select .cse0 |v_main_#t~malloc22.base_12|) 0)) (= |c_old(#valid)| (store (store .cse0 |v_main_#t~malloc22.base_12| 0) |v_main_#t~malloc0.base_6| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_6|)))))) is different from false [2018-04-09 21:19:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:16,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:19:16,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-04-09 21:19:16,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 21:19:16,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 21:19:16,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=374, Unknown=4, NotChecked=120, Total=552 [2018-04-09 21:19:16,892 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 24 states. [2018-04-09 21:19:16,946 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc22.base_12| Int) (|v_main_#t~malloc0.base_6| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_6| 1))) (or (not (= (select .cse0 |v_main_#t~malloc22.base_12|) 0)) (= |c_old(#valid)| (store (store .cse0 |v_main_#t~malloc22.base_12| 0) |v_main_#t~malloc0.base_6| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_6|))))))) is different from false [2018-04-09 21:19:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:18,255 INFO L93 Difference]: Finished difference Result 352 states and 382 transitions. [2018-04-09 21:19:18,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 21:19:18,256 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-04-09 21:19:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:18,257 INFO L225 Difference]: With dead ends: 352 [2018-04-09 21:19:18,257 INFO L226 Difference]: Without dead ends: 349 [2018-04-09 21:19:18,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1019, Unknown=11, NotChecked=276, Total=1482 [2018-04-09 21:19:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-09 21:19:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 298. [2018-04-09 21:19:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-09 21:19:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 325 transitions. [2018-04-09 21:19:18,267 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 325 transitions. Word has length 47 [2018-04-09 21:19:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:18,267 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 325 transitions. [2018-04-09 21:19:18,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 21:19:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 325 transitions. [2018-04-09 21:19:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:19:18,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:18,267 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:18,268 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1651165686, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:18,276 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:18,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:18,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:19:18,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:19:18,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:19:18,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:19:18,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-09 21:19:18,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:19:18,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:18,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:19:18,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:19:18,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:18,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:19:18,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-09 21:19:18,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:19:18,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:19:18,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-09 21:19:18,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:19:18,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 21:19:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:18,423 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:18,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:19:18,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-09 21:19:18,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:19:18,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:19:18,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:19:18,469 INFO L87 Difference]: Start difference. First operand 298 states and 325 transitions. Second operand 5 states. [2018-04-09 21:19:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:18,556 INFO L93 Difference]: Finished difference Result 372 states and 409 transitions. [2018-04-09 21:19:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:19:18,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-09 21:19:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:18,557 INFO L225 Difference]: With dead ends: 372 [2018-04-09 21:19:18,557 INFO L226 Difference]: Without dead ends: 304 [2018-04-09 21:19:18,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:19:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-09 21:19:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2018-04-09 21:19:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-09 21:19:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 322 transitions. [2018-04-09 21:19:18,569 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 322 transitions. Word has length 47 [2018-04-09 21:19:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:18,569 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 322 transitions. [2018-04-09 21:19:18,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:19:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 322 transitions. [2018-04-09 21:19:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:19:18,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:18,570 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-09 21:19:18,570 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -25135956, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:18,578 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:18,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:18,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:19:18,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:19:18,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:18,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:18,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-09 21:19:18,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 21:19:18,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-09 21:19:18,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-09 21:19:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:18,619 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:18,645 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:18,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:19:18,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:19:18,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:19:18,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:19:18,646 INFO L87 Difference]: Start difference. First operand 296 states and 322 transitions. Second operand 5 states. [2018-04-09 21:19:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:18,829 INFO L93 Difference]: Finished difference Result 415 states and 450 transitions. [2018-04-09 21:19:18,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:19:18,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-09 21:19:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:18,830 INFO L225 Difference]: With dead ends: 415 [2018-04-09 21:19:18,830 INFO L226 Difference]: Without dead ends: 414 [2018-04-09 21:19:18,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:19:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-09 21:19:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 295. [2018-04-09 21:19:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-09 21:19:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 321 transitions. [2018-04-09 21:19:18,839 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 321 transitions. Word has length 47 [2018-04-09 21:19:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:18,846 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 321 transitions. [2018-04-09 21:19:18,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:19:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 321 transitions. [2018-04-09 21:19:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:19:18,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:18,847 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-09 21:19:18,847 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash -25135955, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:18,853 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:18,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:18,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:19:18,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:19:18,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:18,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:18,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:18,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:18,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-09 21:19:18,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 21:19:18,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-09 21:19:18,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 21:19:18,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 21:19:18,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:18,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-09 21:19:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:18,918 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:18,961 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:18,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 21:19:18,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:19:18,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:19:18,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:19:18,962 INFO L87 Difference]: Start difference. First operand 295 states and 321 transitions. Second operand 8 states. [2018-04-09 21:19:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:19,166 INFO L93 Difference]: Finished difference Result 432 states and 468 transitions. [2018-04-09 21:19:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:19:19,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-09 21:19:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:19,168 INFO L225 Difference]: With dead ends: 432 [2018-04-09 21:19:19,168 INFO L226 Difference]: Without dead ends: 431 [2018-04-09 21:19:19,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:19:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-09 21:19:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 294. [2018-04-09 21:19:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-09 21:19:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 320 transitions. [2018-04-09 21:19:19,177 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 320 transitions. Word has length 47 [2018-04-09 21:19:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:19,177 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 320 transitions. [2018-04-09 21:19:19,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:19:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 320 transitions. [2018-04-09 21:19:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:19:19,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:19,178 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, 1] [2018-04-09 21:19:19,178 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1500828553, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:19,183 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:19,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:19,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:19,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:19,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:19:19,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 21:19:19,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:19,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:19,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-09 21:19:19,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-09 21:19:19,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:19:19,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:19,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-09 21:19:19,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-04-09 21:19:19,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:19:19,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,276 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 25 treesize of output 10 [2018-04-09 21:19:19,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:19,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-09 21:19:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:19,296 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:19,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-09 21:19:19,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:19,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 21:19:19,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-09 21:19:19,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:19:19,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:19:19,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,459 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:19,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:19:19,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:19:19,481 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-04-09 21:19:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:19,550 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:19,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-09 21:19:19,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 21:19:19,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 21:19:19,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:19:19,551 INFO L87 Difference]: Start difference. First operand 294 states and 320 transitions. Second operand 16 states. [2018-04-09 21:19:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:20,006 INFO L93 Difference]: Finished difference Result 321 states and 349 transitions. [2018-04-09 21:19:20,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:19:20,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-09 21:19:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:20,007 INFO L225 Difference]: With dead ends: 321 [2018-04-09 21:19:20,007 INFO L226 Difference]: Without dead ends: 320 [2018-04-09 21:19:20,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:19:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-09 21:19:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 293. [2018-04-09 21:19:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-09 21:19:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 319 transitions. [2018-04-09 21:19:20,016 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 319 transitions. Word has length 50 [2018-04-09 21:19:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:20,017 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 319 transitions. [2018-04-09 21:19:20,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 21:19:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 319 transitions. [2018-04-09 21:19:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:19:20,017 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:20,017 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, 1] [2018-04-09 21:19:20,017 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1500828552, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:20,023 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:20,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:20,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:20,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:20,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:19:20,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:19:20,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 21:19:20,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:20,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:20,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:20,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:20,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-09 21:19:20,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-09 21:19:20,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:19:20,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-09 21:19:20,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:19:20,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:20,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-09 21:19:20,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-09 21:19:20,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:19:20,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,179 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 36 treesize of output 17 [2018-04-09 21:19:20,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-09 21:19:20,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:19:20,193 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 21:19:20,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,202 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-04-09 21:19:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:20,212 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:20,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-04-09 21:19:20,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:20,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-04-09 21:19:20,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-04-09 21:19:20,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:19:20,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:19:20,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,493 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:19:20,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-09 21:19:20,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:20,547 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-04-09 21:19:20,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:19:20,554 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,555 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,558 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-09 21:19:20,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:20,574 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-09 21:19:20,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-09 21:19:20,581 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,582 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,585 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-04-09 21:19:20,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:20,599 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-09 21:19:20,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-09 21:19:20,606 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,607 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,610 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-09 21:19:20,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:20,641 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 21:19:20,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-09 21:19:20,649 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,650 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,654 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:19:20,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 21:19:20,671 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:115, output treesize:43 [2018-04-09 21:19:20,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 21:19:20,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:20,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-09 21:19:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:20,747 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:20,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-09 21:19:20,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 21:19:20,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 21:19:20,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:19:20,748 INFO L87 Difference]: Start difference. First operand 293 states and 319 transitions. Second operand 16 states. [2018-04-09 21:19:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:21,154 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2018-04-09 21:19:21,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:19:21,155 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-09 21:19:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:21,156 INFO L225 Difference]: With dead ends: 308 [2018-04-09 21:19:21,156 INFO L226 Difference]: Without dead ends: 307 [2018-04-09 21:19:21,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:19:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-09 21:19:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 292. [2018-04-09 21:19:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-09 21:19:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 318 transitions. [2018-04-09 21:19:21,166 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 318 transitions. Word has length 50 [2018-04-09 21:19:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:21,166 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 318 transitions. [2018-04-09 21:19:21,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 21:19:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 318 transitions. [2018-04-09 21:19:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-09 21:19:21,167 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:21,167 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, 1, 1, 1, 1] [2018-04-09 21:19:21,167 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:21,167 INFO L82 PathProgramCache]: Analyzing trace with hash -573736973, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:21,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:21,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:21,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:21,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:21,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 21:19:21,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-09 21:19:21,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:21,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:21,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-09 21:19:21,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-09 21:19:21,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:19:21,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:21,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-09 21:19:21,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-09 21:19:21,280 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 22 treesize of output 29 [2018-04-09 21:19:21,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:21,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:21,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-04-09 21:19:25,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-09 21:19:25,323 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 25 treesize of output 10 [2018-04-09 21:19:25,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:19:25,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:25,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-09 21:19:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:25,351 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:25,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-09 21:19:25,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:25,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 21:19:25,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-09 21:19:25,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 21:19:25,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:19:25,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:19:25,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:19:25,732 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-04-09 21:19:25,795 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:25,796 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:21, output treesize:1 [2018-04-09 21:19:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:25,822 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:25,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2018-04-09 21:19:25,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-09 21:19:25,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-09 21:19:25,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=267, Unknown=2, NotChecked=0, Total=342 [2018-04-09 21:19:25,823 INFO L87 Difference]: Start difference. First operand 292 states and 318 transitions. Second operand 19 states. [2018-04-09 21:19:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:46,428 INFO L93 Difference]: Finished difference Result 319 states and 347 transitions. [2018-04-09 21:19:46,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 21:19:46,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-09 21:19:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:46,429 INFO L225 Difference]: With dead ends: 319 [2018-04-09 21:19:46,429 INFO L226 Difference]: Without dead ends: 318 [2018-04-09 21:19:46,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=296, Invalid=751, Unknown=9, NotChecked=0, Total=1056 [2018-04-09 21:19:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-09 21:19:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-04-09 21:19:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-09 21:19:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 317 transitions. [2018-04-09 21:19:46,438 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 317 transitions. Word has length 53 [2018-04-09 21:19:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:46,439 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 317 transitions. [2018-04-09 21:19:46,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-09 21:19:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2018-04-09 21:19:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-09 21:19:46,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:46,439 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, 1, 1, 1, 1] [2018-04-09 21:19:46,439 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash -573736972, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:46,445 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:46,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:46,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:19:46,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:46,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:46,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:19:46,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 21:19:46,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:46,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:46,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:19:46,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:19:46,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,504 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-09 21:19:46,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-09 21:19:46,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:19:46,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-09 21:19:46,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 21:19:46,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:46,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-09 21:19:46,595 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 48 treesize of output 41 [2018-04-09 21:19:46,598 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 22 treesize of output 29 [2018-04-09 21:19:46,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2018-04-09 21:19:46,626 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 22 treesize of output 29 [2018-04-09 21:19:46,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:46,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:46,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:87 [2018-04-09 21:19:50,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2018-04-09 21:19:50,685 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 38 treesize of output 19 [2018-04-09 21:19:50,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:50,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:19:50,691 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:50,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:50,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-09 21:19:50,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-09 21:19:50,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:50,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:19:50,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:50,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:50,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:50,712 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:9 [2018-04-09 21:19:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:50,724 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:51,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-04-09 21:19:51,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:51,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-09 21:19:51,430 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 56 treesize of output 43 [2018-04-09 21:19:51,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 21:19:51,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:19:51,471 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:19:51,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-09 21:19:51,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:51,523 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 21:19:51,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-09 21:19:51,531 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,532 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,536 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:19:51,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-09 21:19:51,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:51,573 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-09 21:19:51,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-09 21:19:51,579 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,580 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,583 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-09 21:19:51,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:51,598 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-09 21:19:51,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-09 21:19:51,604 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,605 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,607 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-09 21:19:51,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:19:51,623 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-04-09 21:19:51,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:19:51,629 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,630 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,633 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 21:19:51,649 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:121, output treesize:43 [2018-04-09 21:19:51,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 5 treesize of output 3 [2018-04-09 21:19:51,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-09 21:19:51,712 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:19:51,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:51,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2018-04-09 21:19:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:51,741 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:51,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2018-04-09 21:19:51,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-09 21:19:51,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-09 21:19:51,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=279, Unknown=2, NotChecked=0, Total=342 [2018-04-09 21:19:51,742 INFO L87 Difference]: Start difference. First operand 291 states and 317 transitions. Second operand 19 states. [2018-04-09 21:19:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:52,207 INFO L93 Difference]: Finished difference Result 306 states and 334 transitions. [2018-04-09 21:19:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:19:52,207 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-09 21:19:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:52,208 INFO L225 Difference]: With dead ends: 306 [2018-04-09 21:19:52,209 INFO L226 Difference]: Without dead ends: 305 [2018-04-09 21:19:52,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=221, Invalid=647, Unknown=2, NotChecked=0, Total=870 [2018-04-09 21:19:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-09 21:19:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2018-04-09 21:19:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-09 21:19:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 316 transitions. [2018-04-09 21:19:52,218 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 316 transitions. Word has length 53 [2018-04-09 21:19:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:52,218 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 316 transitions. [2018-04-09 21:19:52,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-09 21:19:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 316 transitions. [2018-04-09 21:19:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:19:52,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:52,219 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, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:52,219 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2033903472, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:52,224 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:52,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:52,254 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:52,278 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:52,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:19:52,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:19:52,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:19:52,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:19:52,279 INFO L87 Difference]: Start difference. First operand 290 states and 316 transitions. Second operand 5 states. [2018-04-09 21:19:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:52,340 INFO L93 Difference]: Finished difference Result 410 states and 444 transitions. [2018-04-09 21:19:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 21:19:52,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-09 21:19:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:52,341 INFO L225 Difference]: With dead ends: 410 [2018-04-09 21:19:52,341 INFO L226 Difference]: Without dead ends: 407 [2018-04-09 21:19:52,342 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:19:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-09 21:19:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 296. [2018-04-09 21:19:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-09 21:19:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 323 transitions. [2018-04-09 21:19:52,357 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 323 transitions. Word has length 54 [2018-04-09 21:19:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:52,357 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 323 transitions. [2018-04-09 21:19:52,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:19:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 323 transitions. [2018-04-09 21:19:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:19:52,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:52,358 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:52,358 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2033903854, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:52,363 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:52,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:52,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:52,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:52,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:19:52,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:19:52,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:52,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 21:19:52,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:52,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-09 21:19:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:52,421 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:52,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:19:52,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:19:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:52,474 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:52,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2018-04-09 21:19:52,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 21:19:52,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 21:19:52,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:19:52,475 INFO L87 Difference]: Start difference. First operand 296 states and 323 transitions. Second operand 10 states. [2018-04-09 21:19:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:52,754 INFO L93 Difference]: Finished difference Result 349 states and 375 transitions. [2018-04-09 21:19:52,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-09 21:19:52,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-09 21:19:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:52,756 INFO L225 Difference]: With dead ends: 349 [2018-04-09 21:19:52,756 INFO L226 Difference]: Without dead ends: 347 [2018-04-09 21:19:52,756 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:19:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-09 21:19:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 301. [2018-04-09 21:19:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-04-09 21:19:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 329 transitions. [2018-04-09 21:19:52,766 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 329 transitions. Word has length 54 [2018-04-09 21:19:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:52,766 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 329 transitions. [2018-04-09 21:19:52,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 21:19:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 329 transitions. [2018-04-09 21:19:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:19:52,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:52,767 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:52,767 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:52,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2033903853, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:52,772 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:52,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:52,813 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:52,827 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:19:52,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,838 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 8 treesize of output 6 [2018-04-09 21:19:52,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:52,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:10 [2018-04-09 21:19:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:52,870 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:52,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-09 21:19:52,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:19:52,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:19:52,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:19:52,870 INFO L87 Difference]: Start difference. First operand 301 states and 329 transitions. Second operand 9 states. [2018-04-09 21:19:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:53,088 INFO L93 Difference]: Finished difference Result 478 states and 508 transitions. [2018-04-09 21:19:53,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:19:53,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-09 21:19:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:53,089 INFO L225 Difference]: With dead ends: 478 [2018-04-09 21:19:53,090 INFO L226 Difference]: Without dead ends: 476 [2018-04-09 21:19:53,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-04-09 21:19:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-04-09 21:19:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 304. [2018-04-09 21:19:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-09 21:19:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 330 transitions. [2018-04-09 21:19:53,100 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 330 transitions. Word has length 54 [2018-04-09 21:19:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:53,100 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 330 transitions. [2018-04-09 21:19:53,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:19:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 330 transitions. [2018-04-09 21:19:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:19:53,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:53,101 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, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:53,101 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash 845594930, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:53,107 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:53,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,134 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,158 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:53,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 21:19:53,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:19:53,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:19:53,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:19:53,159 INFO L87 Difference]: Start difference. First operand 304 states and 330 transitions. Second operand 5 states. [2018-04-09 21:19:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:53,213 INFO L93 Difference]: Finished difference Result 400 states and 429 transitions. [2018-04-09 21:19:53,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:19:53,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-09 21:19:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:53,214 INFO L225 Difference]: With dead ends: 400 [2018-04-09 21:19:53,214 INFO L226 Difference]: Without dead ends: 397 [2018-04-09 21:19:53,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:19:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-09 21:19:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 304. [2018-04-09 21:19:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-09 21:19:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-04-09 21:19:53,224 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 54 [2018-04-09 21:19:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:53,225 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-04-09 21:19:53,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:19:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-04-09 21:19:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 21:19:53,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:53,225 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:53,225 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash 845594548, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:53,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:53,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:53,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:53,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:53,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:19:53,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:53,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:53,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:19:53,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:53,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 21:19:53,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:53,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:53,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-09 21:19:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:53,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-09 21:19:53,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:53,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:53,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:19:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,330 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:53,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2018-04-09 21:19:53,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 21:19:53,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 21:19:53,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-09 21:19:53,331 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 10 states. [2018-04-09 21:19:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:53,562 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2018-04-09 21:19:53,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 21:19:53,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-09 21:19:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:53,563 INFO L225 Difference]: With dead ends: 315 [2018-04-09 21:19:53,564 INFO L226 Difference]: Without dead ends: 313 [2018-04-09 21:19:53,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:19:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-09 21:19:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 304. [2018-04-09 21:19:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-09 21:19:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 327 transitions. [2018-04-09 21:19:53,581 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 327 transitions. Word has length 54 [2018-04-09 21:19:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:53,582 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 327 transitions. [2018-04-09 21:19:53,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 21:19:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 327 transitions. [2018-04-09 21:19:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 21:19:53,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:53,583 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:53,583 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2086927992, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:53,591 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:53,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,620 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,644 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:53,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:19:53,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:19:53,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:19:53,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:19:53,645 INFO L87 Difference]: Start difference. First operand 304 states and 327 transitions. Second operand 5 states. [2018-04-09 21:19:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:53,697 INFO L93 Difference]: Finished difference Result 395 states and 424 transitions. [2018-04-09 21:19:53,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:19:53,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-04-09 21:19:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:53,699 INFO L225 Difference]: With dead ends: 395 [2018-04-09 21:19:53,699 INFO L226 Difference]: Without dead ends: 394 [2018-04-09 21:19:53,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:19:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-09 21:19:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2018-04-09 21:19:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-09 21:19:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 315 transitions. [2018-04-09 21:19:53,709 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 315 transitions. Word has length 60 [2018-04-09 21:19:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:53,709 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 315 transitions. [2018-04-09 21:19:53,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:19:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 315 transitions. [2018-04-09 21:19:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-09 21:19:53,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:53,710 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:53,710 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1060091593, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:53,715 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:53,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,771 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:53,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-04-09 21:19:53,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 21:19:53,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:19:53,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-04-09 21:19:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:53,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:19:53,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-04-09 21:19:53,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 21:19:53,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 21:19:53,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:19:53,872 INFO L87 Difference]: Start difference. First operand 293 states and 315 transitions. Second operand 14 states. [2018-04-09 21:19:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:19:54,326 INFO L93 Difference]: Finished difference Result 591 states and 637 transitions. [2018-04-09 21:19:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-09 21:19:54,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-09 21:19:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:19:54,328 INFO L225 Difference]: With dead ends: 591 [2018-04-09 21:19:54,328 INFO L226 Difference]: Without dead ends: 589 [2018-04-09 21:19:54,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-04-09 21:19:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-09 21:19:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 303. [2018-04-09 21:19:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-09 21:19:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 326 transitions. [2018-04-09 21:19:54,339 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 326 transitions. Word has length 62 [2018-04-09 21:19:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:19:54,340 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 326 transitions. [2018-04-09 21:19:54,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 21:19:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 326 transitions. [2018-04-09 21:19:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-09 21:19:54,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:19:54,341 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:19:54,341 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:19:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash -700933309, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:19:54,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:19:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:19:54,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:19:54,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:19:54,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:19:54,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:19:54,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:19:54,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-09 21:19:54,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:19:54,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:19:54,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:19:54,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:19:54,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-09 21:19:54,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:19:54,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 21:19:54,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:19:54,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 21:19:54,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-04-09 21:19:54,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:19:54,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:55 [2018-04-09 21:19:54,564 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 37 treesize of output 38 [2018-04-09 21:19:54,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 8 treesize of output 7 [2018-04-09 21:19:54,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,592 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 37 treesize of output 38 [2018-04-09 21:19:54,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:19:54,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-04-09 21:19:54,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-09 21:19:54,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:19:54,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,679 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 46 treesize of output 63 [2018-04-09 21:19:54,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:54,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:19:54,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:54,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:147 [2018-04-09 21:19:55,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 141 [2018-04-09 21:19:55,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:55,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:55,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:55,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2018-04-09 21:19:55,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:55,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:55,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 67 [2018-04-09 21:19:55,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:55,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:19:55,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2018-04-09 21:19:55,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:55,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:55,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:19:55,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-04-09 21:19:55,059 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:55,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-09 21:19:55,066 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:19:55,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:55,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:19:55,071 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:185, output treesize:7 [2018-04-09 21:19:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:55,115 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:19:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:19:57,449 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:19:57,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 11] imperfect sequences [] total 21 [2018-04-09 21:19:57,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:19:57,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:19:57,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:19:57,450 INFO L87 Difference]: Start difference. First operand 303 states and 326 transitions. Second operand 21 states. [2018-04-09 21:20:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:20:47,687 INFO L93 Difference]: Finished difference Result 417 states and 447 transitions. [2018-04-09 21:20:47,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 21:20:47,688 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-04-09 21:20:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:20:47,689 INFO L225 Difference]: With dead ends: 417 [2018-04-09 21:20:47,689 INFO L226 Difference]: Without dead ends: 332 [2018-04-09 21:20:47,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2018-04-09 21:20:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-09 21:20:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 303. [2018-04-09 21:20:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-09 21:20:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 325 transitions. [2018-04-09 21:20:47,699 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 325 transitions. Word has length 63 [2018-04-09 21:20:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:20:47,699 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 325 transitions. [2018-04-09 21:20:47,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:20:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 325 transitions. [2018-04-09 21:20:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-09 21:20:47,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:20:47,700 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:20:47,700 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:20:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2020444385, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:20:47,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:20:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:20:47,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:20:47,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:20:47,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:20:47,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:20:47,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:20:47,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-09 21:20:47,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 21:20:47,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:47,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:20:47,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,806 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 23 treesize of output 18 [2018-04-09 21:20:47,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:47,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:20:47,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-09 21:20:47,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:47,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:47,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:20:47,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-04-09 21:20:47,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:20:47,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:20:47,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:20:47,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:20:47,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:58 [2018-04-09 21:20:47,929 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 39 treesize of output 38 [2018-04-09 21:20:47,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:47,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:20:47,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,960 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 39 treesize of output 50 [2018-04-09 21:20:47,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:47,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-09 21:20:47,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:47,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:118 [2018-04-09 21:20:48,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 105 [2018-04-09 21:20:48,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:48,157 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:20:48,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-09 21:20:48,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:48,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:48,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 50 [2018-04-09 21:20:48,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:20:48,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:20:48,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-04-09 21:20:48,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:48,199 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:20:48,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-09 21:20:48,199 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:48,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:20:48,209 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:20:48,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-04-09 21:20:48,210 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:48,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:48,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:48,218 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:160, output treesize:7 [2018-04-09 21:20:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:20:48,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:20:50,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-09 21:20:50,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:20:50,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,120 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-04-09 21:20:50,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-04-09 21:20:50,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-09 21:20:50,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,135 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:20:50,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-09 21:20:50,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:20:50,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:20:50,164 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 37 treesize of output 39 [2018-04-09 21:20:50,166 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:20:50,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-04-09 21:20:50,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-09 21:20:50,186 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,191 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:20:50,219 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:20:50,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:20:50,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-09 21:20:50,222 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,225 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:20:50,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-09 21:20:50,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:20:50,314 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,332 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 37 treesize of output 39 [2018-04-09 21:20:50,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:20:50,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-04-09 21:20:50,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-09 21:20:50,354 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,358 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,368 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,369 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-04-09 21:20:50,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-04-09 21:20:50,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-09 21:20:50,382 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:20:50,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-09 21:20:50,384 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,394 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:20:50,403 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:20:50,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:20:50,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-09 21:20:50,406 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,409 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:20:50,426 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:20:50,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-09 21:20:50,477 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 8 variables, input treesize:111, output treesize:85 [2018-04-09 21:20:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:20:50,569 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:20:50,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 26 [2018-04-09 21:20:50,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-09 21:20:50,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-09 21:20:50,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-04-09 21:20:50,570 INFO L87 Difference]: Start difference. First operand 303 states and 325 transitions. Second operand 26 states. [2018-04-09 21:21:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:21:34,401 INFO L93 Difference]: Finished difference Result 402 states and 430 transitions. [2018-04-09 21:21:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 21:21:34,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-04-09 21:21:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:21:34,403 INFO L225 Difference]: With dead ends: 402 [2018-04-09 21:21:34,403 INFO L226 Difference]: Without dead ends: 302 [2018-04-09 21:21:34,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=379, Invalid=1601, Unknown=0, NotChecked=0, Total=1980 [2018-04-09 21:21:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-09 21:21:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 279. [2018-04-09 21:21:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-09 21:21:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 300 transitions. [2018-04-09 21:21:34,412 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 300 transitions. Word has length 63 [2018-04-09 21:21:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:21:34,412 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 300 transitions. [2018-04-09 21:21:34,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-09 21:21:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 300 transitions. [2018-04-09 21:21:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-09 21:21:34,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:21:34,414 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:21:34,414 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-09 21:21:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2124238647, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:21:34,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:21:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:21:34,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:21:34,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:21:34,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:21:34,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 21:21:34,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:21:34,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-09 21:21:34,477 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 23 treesize of output 18 [2018-04-09 21:21:34,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:21:34,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,496 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 23 treesize of output 18 [2018-04-09 21:21:34,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:21:34,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-09 21:21:34,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:21:34,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:21:34,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2018-04-09 21:21:34,596 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 30 treesize of output 23 [2018-04-09 21:21:34,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 21:21:34,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,631 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 30 treesize of output 23 [2018-04-09 21:21:34,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:34,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-09 21:21:34,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:21:34,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:54 [2018-04-09 21:21:34,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-09 21:21:34,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:21:34,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-09 21:21:34,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 21:21:34,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 21:21:34,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:76 [2018-04-09 21:21:34,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2018-04-09 21:21:34,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-09 21:21:34,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,851 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 51 treesize of output 46 [2018-04-09 21:21:34,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-09 21:21:34,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:34,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-09 21:21:34,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:118, output treesize:102 [2018-04-09 21:21:38,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-09 21:21:38,977 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:21:38,977 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 22 treesize of output 30 [2018-04-09 21:21:38,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:38,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:39,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2018-04-09 21:21:39,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-04-09 21:21:39,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-09 21:21:39,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:21:39,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-09 21:21:39,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:187 [2018-04-09 21:21:55,163 WARN L148 SmtUtils]: Spent 16058ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-09 21:21:55,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 87 [2018-04-09 21:21:55,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:21:55,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,232 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:21:55,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-04-09 21:21:55,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:21:55,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:21:55,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 114 [2018-04-09 21:21:55,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-04-09 21:21:55,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,316 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:21:55,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-04-09 21:21:55,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2018-04-09 21:21:55,369 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-09 21:21:55,369 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-09 21:21:55,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:21:55,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-04-09 21:21:55,393 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,403 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:21:55,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-04-09 21:21:55,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:21:55,437 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:21:55,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-04-09 21:21:55,438 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-09 21:21:55,448 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,454 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:21:55,478 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:223, output treesize:7 [2018-04-09 21:21:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:21:55,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:22:01,938 WARN L148 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-09 21:22:01,949 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:01,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:01,950 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 52 treesize of output 43 [2018-04-09 21:22:01,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:22:01,966 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:01,966 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:01,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-09 21:22:01,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:22:01,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-09 21:22:01,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:105, output treesize:87 [2018-04-09 21:22:02,097 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-09 21:22:02,602 WARN L148 SmtUtils]: Spent 335ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-09 21:22:10,568 WARN L148 SmtUtils]: Spent 1817ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-09 21:22:10,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-09 21:22:10,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-04-09 21:22:10,642 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-04-09 21:22:10,645 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,646 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,646 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-09 21:22:10,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,659 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-09 21:22:10,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,672 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,672 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-04-09 21:22:10,675 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,680 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-09 21:22:10,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-04-09 21:22:10,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-04-09 21:22:10,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-09 21:22:10,732 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,739 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,743 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-09 21:22:10,755 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,755 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,756 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,756 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:22:10,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-04-09 21:22:10,759 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,764 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:22:10,779 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:131, output treesize:7 [2018-04-09 21:22:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 21:22:10,836 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:22:10,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 16] imperfect sequences [] total 28 [2018-04-09 21:22:10,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-09 21:22:10,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-09 21:22:10,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=616, Unknown=5, NotChecked=0, Total=756 [2018-04-09 21:22:10,837 INFO L87 Difference]: Start difference. First operand 279 states and 300 transitions. Second operand 28 states. [2018-04-09 21:22:19,319 WARN L148 SmtUtils]: Spent 8081ms on a formula simplification that was a NOOP. DAG size: 100 Received shutdown request... [2018-04-09 21:22:21,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:22:21,408 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 21:22:21,413 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 21:22:21,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 09:22:21 BoogieIcfgContainer [2018-04-09 21:22:21,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 21:22:21,414 INFO L168 Benchmark]: Toolchain (without parser) took 268477.14 ms. Allocated memory was 303.0 MB in the beginning and 579.9 MB in the end (delta: 276.8 MB). Free memory was 238.7 MB in the beginning and 454.4 MB in the end (delta: -215.7 MB). Peak memory consumption was 61.1 MB. Max. memory is 5.3 GB. [2018-04-09 21:22:21,415 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.0 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 21:22:21,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.64 ms. Allocated memory is still 303.0 MB. Free memory was 238.7 MB in the beginning and 213.6 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:22:21,415 INFO L168 Benchmark]: Boogie Preprocessor took 61.70 ms. Allocated memory is still 303.0 MB. Free memory was 213.6 MB in the beginning and 210.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:22:21,416 INFO L168 Benchmark]: RCFGBuilder took 751.37 ms. Allocated memory was 303.0 MB in the beginning and 465.0 MB in the end (delta: 162.0 MB). Free memory was 210.6 MB in the beginning and 376.7 MB in the end (delta: -166.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. [2018-04-09 21:22:21,416 INFO L168 Benchmark]: TraceAbstraction took 267324.86 ms. Allocated memory was 465.0 MB in the beginning and 579.9 MB in the end (delta: 114.8 MB). Free memory was 376.7 MB in the beginning and 454.4 MB in the end (delta: -77.7 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. [2018-04-09 21:22:21,417 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.22 ms. Allocated memory is still 303.0 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 334.64 ms. Allocated memory is still 303.0 MB. Free memory was 238.7 MB in the beginning and 213.6 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 61.70 ms. Allocated memory is still 303.0 MB. Free memory was 213.6 MB in the beginning and 210.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 751.37 ms. Allocated memory was 303.0 MB in the beginning and 465.0 MB in the end (delta: 162.0 MB). Free memory was 210.6 MB in the beginning and 376.7 MB in the end (delta: -166.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 267324.86 ms. Allocated memory was 465.0 MB in the beginning and 579.9 MB in the end (delta: 114.8 MB). Free memory was 376.7 MB in the beginning and 454.4 MB in the end (delta: -77.7 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (279states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 102. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 210 locations, 75 error locations. TIMEOUT Result, 267.2s OverallTime, 52 OverallIterations, 3 TraceHistogramMax, 176.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8388 SDtfs, 14676 SDslu, 31323 SDs, 0 SdLazy, 17912 SolverSat, 908 SolverUnsat, 76 SolverUnknown, 0 SolverNotchecked, 126.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4562 GetRequests, 3790 SyntacticMatches, 24 SemanticMatches, 747 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3097 ImplicationChecksByTransitivity, 124.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=45, 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.5s AutomataMinimizationTime, 51 MinimizatonAttempts, 3020 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 87.9s InterpolantComputationTime, 2143 NumberOfCodeBlocks, 2143 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4182 ConstructedInterpolants, 343 QuantifiedInterpolants, 1955708 SizeOfPredicates, 429 NumberOfNonLiveVariables, 7429 ConjunctsInSsa, 658 ConjunctsInUnsatCore, 104 InterpolantComputations, 98 PerfectInterpolantSequences, 149/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_21-22-21-424.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_21-22-21-424.csv Completed graceful shutdown