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-8168ed2-m [2018-04-11 21:35:32,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 21:35:32,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 21:35:32,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 21:35:32,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 21:35:32,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 21:35:32,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 21:35:32,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 21:35:32,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 21:35:32,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 21:35:32,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 21:35:32,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 21:35:32,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 21:35:32,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 21:35:32,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 21:35:32,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 21:35:32,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 21:35:32,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 21:35:32,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 21:35:32,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 21:35:32,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 21:35:32,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 21:35:32,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 21:35:32,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 21:35:32,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 21:35:32,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 21:35:32,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 21:35:32,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 21:35:32,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 21:35:32,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 21:35:32,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 21:35:32,907 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 21:35:32,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 21:35:32,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 21:35:32,932 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 21:35:32,932 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 21:35:32,933 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 21:35:32,933 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 21:35:32,933 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 21:35:32,933 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 21:35:32,933 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 21:35:32,934 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 21:35:32,934 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 21:35:32,934 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 21:35:32,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 21:35:32,935 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 21:35:32,935 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 21:35:32,935 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 21:35:32,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 21:35:32,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 21:35:32,936 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 21:35:32,936 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 21:35:32,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 21:35:32,936 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 21:35:32,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 21:35:32,937 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 21:35:32,937 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 21:35:32,937 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 21:35:32,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:35:32,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 21:35:32,938 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 21:35:32,938 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 21:35:32,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 21:35:32,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 21:35:32,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 21:35:32,939 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 21:35:32,940 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 21:35:32,940 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 21:35:32,940 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 21:35:32,940 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 21:35:32,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 21:35:32,989 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 21:35:32,993 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 21:35:32,994 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 21:35:32,995 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 21:35:32,996 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-11 21:35:33,324 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3a2928c43 [2018-04-11 21:35:33,502 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 21:35:33,502 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 21:35:33,502 INFO L168 CDTParser]: Scanning tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 21:35:33,512 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 21:35:33,512 INFO L215 ultiparseSymbolTable]: [2018-04-11 21:35:33,512 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 21:35:33,512 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 21:35:33,512 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 21:35:33,512 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-11 21:35:33,512 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-11 21:35:33,512 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-11 21:35:33,512 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,513 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,514 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,515 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,516 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-11 21:35:33,517 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-11 21:35:33,517 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-11 21:35:33,517 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-11 21:35:33,517 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-11 21:35:33,517 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-11 21:35:33,517 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-11 21:35:33,517 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-11 21:35:33,517 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-11 21:35:33,518 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-11 21:35:33,518 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-11 21:35:33,518 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-11 21:35:33,518 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-11 21:35:33,518 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-11 21:35:33,518 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-11 21:35:33,518 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-11 21:35:33,518 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,519 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,520 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,521 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,522 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-11 21:35:33,523 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-11 21:35:33,523 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-11 21:35:33,523 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-11 21:35:33,523 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-11 21:35:33,523 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-11 21:35:33,523 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-11 21:35:33,523 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-11 21:35:33,523 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-11 21:35:33,524 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-11 21:35:33,524 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-11 21:35:33,524 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-11 21:35:33,540 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3a2928c43 [2018-04-11 21:35:33,544 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 21:35:33,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 21:35:33,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 21:35:33,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 21:35:33,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 21:35:33,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567e9624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33, skipping insertion in model container [2018-04-11 21:35:33,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,573 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:35:33,604 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:35:33,773 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:35:33,825 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:35:33,832 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 21:35:33,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33 WrapperNode [2018-04-11 21:35:33,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 21:35:33,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 21:35:33,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 21:35:33,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 21:35:33,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... [2018-04-11 21:35:33,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 21:35:33,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 21:35:33,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 21:35:33,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 21:35:33,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:35:34,059 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 21:35:34,059 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 21:35:34,059 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 21:35:34,059 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 21:35:34,060 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 21:35:34,061 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 21:35:34,062 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 21:35:34,062 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 21:35:34,062 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 21:35:34,062 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 21:35:34,062 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 21:35:34,062 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 21:35:34,062 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 21:35:34,063 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 21:35:34,064 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 21:35:34,065 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 21:35:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 21:35:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 21:35:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 21:35:34,069 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 21:35:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 21:35:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 21:35:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 21:35:34,709 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 21:35:34,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:35:34 BoogieIcfgContainer [2018-04-11 21:35:34,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 21:35:34,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 21:35:34,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 21:35:34,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 21:35:34,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:35:33" (1/3) ... [2018-04-11 21:35:34,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5964835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:35:34, skipping insertion in model container [2018-04-11 21:35:34,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:35:33" (2/3) ... [2018-04-11 21:35:34,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5964835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:35:34, skipping insertion in model container [2018-04-11 21:35:34,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:35:34" (3/3) ... [2018-04-11 21:35:34,715 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 21:35:34,721 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 21:35:34,727 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-04-11 21:35:34,770 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 21:35:34,770 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 21:35:34,770 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 21:35:34,771 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 21:35:34,771 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 21:35:34,771 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 21:35:34,771 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 21:35:34,771 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 21:35:34,771 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 21:35:34,772 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 21:35:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-04-11 21:35:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 21:35:34,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:34,798 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:34,798 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-11 21:35:34,802 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-11 21:35:34,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:34,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:34,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:34,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:34,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:34,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:35:34,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-11 21:35:34,945 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:34,988 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:34,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:34,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:35,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:35,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:35,002 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-04-11 21:35:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:35,257 INFO L93 Difference]: Finished difference Result 424 states and 452 transitions. [2018-04-11 21:35:35,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:35:35,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-04-11 21:35:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:35,270 INFO L225 Difference]: With dead ends: 424 [2018-04-11 21:35:35,270 INFO L226 Difference]: Without dead ends: 225 [2018-04-11 21:35:35,275 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-11 21:35:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-11 21:35:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 204. [2018-04-11 21:35:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 21:35:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-04-11 21:35:35,323 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 10 [2018-04-11 21:35:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:35,323 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-04-11 21:35:35,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-04-11 21:35:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 21:35:35,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:35,324 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:35,324 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-11 21:35:35,324 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-11 21:35:35,330 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:35,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:35,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:35,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:35,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:35,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:35:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:35,380 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:35,471 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:35,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 21:35:35,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:35:35,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:35:35,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:35:35,490 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 6 states. [2018-04-11 21:35:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:35,817 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2018-04-11 21:35:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:35,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-04-11 21:35:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:35,819 INFO L225 Difference]: With dead ends: 244 [2018-04-11 21:35:35,819 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 21:35:35,820 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-11 21:35:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 21:35:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 201. [2018-04-11 21:35:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 21:35:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2018-04-11 21:35:35,830 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 10 [2018-04-11 21:35:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:35,830 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2018-04-11 21:35:35,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:35:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2018-04-11 21:35:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 21:35:35,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:35,831 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-11 21:35:35,831 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-11 21:35:35,832 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-11 21:35:35,838 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:35,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:35,873 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:35,902 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:35,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:35,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:35,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:35,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:35,903 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 4 states. [2018-04-11 21:35:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:36,076 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-04-11 21:35:36,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:36,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 21:35:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:36,078 INFO L225 Difference]: With dead ends: 233 [2018-04-11 21:35:36,078 INFO L226 Difference]: Without dead ends: 215 [2018-04-11 21:35:36,079 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-11 21:35:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-11 21:35:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 186. [2018-04-11 21:35:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 21:35:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2018-04-11 21:35:36,092 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 19 [2018-04-11 21:35:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:36,092 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2018-04-11 21:35:36,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2018-04-11 21:35:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 21:35:36,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:36,093 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-11 21:35:36,093 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-11 21:35:36,093 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-11 21:35:36,099 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:36,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:36,131 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:36,185 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:36,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:36,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:36,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:36,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:36,186 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2018-04-11 21:35:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:36,387 INFO L93 Difference]: Finished difference Result 284 states and 307 transitions. [2018-04-11 21:35:36,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:36,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 21:35:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:36,389 INFO L225 Difference]: With dead ends: 284 [2018-04-11 21:35:36,389 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 21:35:36,390 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-11 21:35:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 21:35:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 229. [2018-04-11 21:35:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 21:35:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 253 transitions. [2018-04-11 21:35:36,404 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 253 transitions. Word has length 19 [2018-04-11 21:35:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:36,404 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 253 transitions. [2018-04-11 21:35:36,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 253 transitions. [2018-04-11 21:35:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 21:35:36,406 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:36,406 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:36,406 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-11 21:35:36,406 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-11 21:35:36,412 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:36,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:36,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:36,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:36,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:36,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:35:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:36,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:36,461 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:36,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:36,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:36,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:36,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:36,462 INFO L87 Difference]: Start difference. First operand 229 states and 253 transitions. Second operand 4 states. [2018-04-11 21:35:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:36,564 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2018-04-11 21:35:36,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:36,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-11 21:35:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:36,566 INFO L225 Difference]: With dead ends: 250 [2018-04-11 21:35:36,566 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 21:35:36,566 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-11 21:35:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 21:35:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2018-04-11 21:35:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-11 21:35:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 257 transitions. [2018-04-11 21:35:36,578 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 257 transitions. Word has length 21 [2018-04-11 21:35:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:36,579 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 257 transitions. [2018-04-11 21:35:36,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 257 transitions. [2018-04-11 21:35:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 21:35:36,579 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:36,580 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:36,580 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-11 21:35:36,580 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-11 21:35:36,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:36,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:36,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:36,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:36,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:36,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:35:36,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-11 21:35:36,623 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:36,658 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:36,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 21:35:36,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:35:36,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:35:36,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:35:36,660 INFO L87 Difference]: Start difference. First operand 231 states and 257 transitions. Second operand 6 states. [2018-04-11 21:35:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:36,823 INFO L93 Difference]: Finished difference Result 236 states and 260 transitions. [2018-04-11 21:35:36,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:36,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 21:35:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:36,825 INFO L225 Difference]: With dead ends: 236 [2018-04-11 21:35:36,825 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 21:35:36,825 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-11 21:35:36,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 21:35:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2018-04-11 21:35:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 21:35:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2018-04-11 21:35:36,832 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 21 [2018-04-11 21:35:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:36,832 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2018-04-11 21:35:36,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:35:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2018-04-11 21:35:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:35:36,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:36,833 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:36,833 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-11 21:35:36,833 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-11 21:35:36,839 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:36,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:36,864 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:36,921 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:36,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-11 21:35:36,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:35:36,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:35:36,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:35:36,922 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand 8 states. [2018-04-11 21:35:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:37,205 INFO L93 Difference]: Finished difference Result 377 states and 417 transitions. [2018-04-11 21:35:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:35:37,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 21:35:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:37,210 INFO L225 Difference]: With dead ends: 377 [2018-04-11 21:35:37,211 INFO L226 Difference]: Without dead ends: 371 [2018-04-11 21:35:37,211 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-11 21:35:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-11 21:35:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 271. [2018-04-11 21:35:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-11 21:35:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2018-04-11 21:35:37,225 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 22 [2018-04-11 21:35:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:37,225 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2018-04-11 21:35:37,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:35:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2018-04-11 21:35:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 21:35:37,226 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:37,226 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-11 21:35:37,226 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-11 21:35:37,227 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-11 21:35:37,235 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:37,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:37,272 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:37,312 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:37,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-11 21:35:37,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:37,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:37,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:37,314 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand 4 states. [2018-04-11 21:35:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:37,369 INFO L93 Difference]: Finished difference Result 275 states and 308 transitions. [2018-04-11 21:35:37,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:35:37,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 21:35:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:37,371 INFO L225 Difference]: With dead ends: 275 [2018-04-11 21:35:37,371 INFO L226 Difference]: Without dead ends: 272 [2018-04-11 21:35:37,372 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-11 21:35:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-11 21:35:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-04-11 21:35:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-11 21:35:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 304 transitions. [2018-04-11 21:35:37,385 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 304 transitions. Word has length 26 [2018-04-11 21:35:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:37,386 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 304 transitions. [2018-04-11 21:35:37,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 304 transitions. [2018-04-11 21:35:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 21:35:37,389 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:37,389 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:37,389 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-11 21:35:37,389 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-11 21:35:37,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:37,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:37,464 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:37,507 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:37,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:37,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:37,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:37,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:37,509 INFO L87 Difference]: Start difference. First operand 271 states and 304 transitions. Second operand 4 states. [2018-04-11 21:35:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:37,733 INFO L93 Difference]: Finished difference Result 296 states and 331 transitions. [2018-04-11 21:35:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:37,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-11 21:35:37,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:37,735 INFO L225 Difference]: With dead ends: 296 [2018-04-11 21:35:37,735 INFO L226 Difference]: Without dead ends: 292 [2018-04-11 21:35:37,736 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-11 21:35:37,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-11 21:35:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 271. [2018-04-11 21:35:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-11 21:35:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2018-04-11 21:35:37,748 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 29 [2018-04-11 21:35:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:37,748 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2018-04-11 21:35:37,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2018-04-11 21:35:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 21:35:37,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:37,752 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:37,752 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-11 21:35:37,752 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-11 21:35:37,765 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:37,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:37,828 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:37,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-11 21:35:37,885 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:37,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:37,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:37,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:37,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:37,886 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand 4 states. [2018-04-11 21:35:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:38,060 INFO L93 Difference]: Finished difference Result 295 states and 330 transitions. [2018-04-11 21:35:38,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:38,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-11 21:35:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:38,062 INFO L225 Difference]: With dead ends: 295 [2018-04-11 21:35:38,062 INFO L226 Difference]: Without dead ends: 294 [2018-04-11 21:35:38,063 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-11 21:35:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-11 21:35:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 284. [2018-04-11 21:35:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-11 21:35:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-04-11 21:35:38,075 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 29 [2018-04-11 21:35:38,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:38,076 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-04-11 21:35:38,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-04-11 21:35:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 21:35:38,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:38,078 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-11 21:35:38,078 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-11 21:35:38,078 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-11 21:35:38,085 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:38,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:38,135 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:38,204 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:38,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 21:35:38,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:35:38,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:35:38,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:35:38,205 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 6 states. [2018-04-11 21:35:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:38,415 INFO L93 Difference]: Finished difference Result 315 states and 357 transitions. [2018-04-11 21:35:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:35:38,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-11 21:35:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:38,417 INFO L225 Difference]: With dead ends: 315 [2018-04-11 21:35:38,417 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 21:35:38,418 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-11 21:35:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 21:35:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 287. [2018-04-11 21:35:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-11 21:35:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 327 transitions. [2018-04-11 21:35:38,426 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 327 transitions. Word has length 32 [2018-04-11 21:35:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:38,426 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 327 transitions. [2018-04-11 21:35:38,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:35:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 327 transitions. [2018-04-11 21:35:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 21:35:38,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:38,428 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-11 21:35:38,428 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-11 21:35:38,428 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-11 21:35:38,438 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:38,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:38,473 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-11 21:35:38,473 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:38,487 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-11 21:35:38,522 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:38,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:38,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:35:38,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:35:38,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:35:38,523 INFO L87 Difference]: Start difference. First operand 287 states and 327 transitions. Second operand 3 states. [2018-04-11 21:35:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:38,549 INFO L93 Difference]: Finished difference Result 548 states and 626 transitions. [2018-04-11 21:35:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:35:38,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-04-11 21:35:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:38,551 INFO L225 Difference]: With dead ends: 548 [2018-04-11 21:35:38,551 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 21:35:38,553 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-11 21:35:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 21:35:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-04-11 21:35:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-11 21:35:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 308 transitions. [2018-04-11 21:35:38,564 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 308 transitions. Word has length 33 [2018-04-11 21:35:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:38,564 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 308 transitions. [2018-04-11 21:35:38,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:35:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 308 transitions. [2018-04-11 21:35:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 21:35:38,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:38,566 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-11 21:35:38,566 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-11 21:35:38,566 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-11 21:35:38,578 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:38,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:38,604 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:38,631 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:38,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:38,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:35:38,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:35:38,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:35:38,632 INFO L87 Difference]: Start difference. First operand 273 states and 308 transitions. Second operand 3 states. [2018-04-11 21:35:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:38,653 INFO L93 Difference]: Finished difference Result 472 states and 531 transitions. [2018-04-11 21:35:38,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:35:38,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-04-11 21:35:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:38,655 INFO L225 Difference]: With dead ends: 472 [2018-04-11 21:35:38,655 INFO L226 Difference]: Without dead ends: 277 [2018-04-11 21:35:38,656 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-11 21:35:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-11 21:35:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-04-11 21:35:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-04-11 21:35:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 312 transitions. [2018-04-11 21:35:38,666 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 312 transitions. Word has length 34 [2018-04-11 21:35:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:38,667 INFO L459 AbstractCegarLoop]: Abstraction has 277 states and 312 transitions. [2018-04-11 21:35:38,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:35:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 312 transitions. [2018-04-11 21:35:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:35:38,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:38,668 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-11 21:35:38,668 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-11 21:35:38,668 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-11 21:35:38,677 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:38,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:38,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:38,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:38,727 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-11 21:35:38,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 21:35:38,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:35:38,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:35:38,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-11 21:35:38,815 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-11 21:35:38,818 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-11 21:35:38,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-04-11 21:35:38,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:38,915 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-11 21:35:38,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:38,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:38,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 21:35:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:38,953 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:39,186 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:39,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-11 21:35:39,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 21:35:39,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 21:35:39,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:35:39,187 INFO L87 Difference]: Start difference. First operand 277 states and 312 transitions. Second operand 18 states. [2018-04-11 21:35:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:40,224 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2018-04-11 21:35:40,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 21:35:40,224 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-04-11 21:35:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:40,226 INFO L225 Difference]: With dead ends: 306 [2018-04-11 21:35:40,226 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 21:35:40,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-04-11 21:35:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 21:35:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 280. [2018-04-11 21:35:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-11 21:35:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 316 transitions. [2018-04-11 21:35:40,239 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 316 transitions. Word has length 35 [2018-04-11 21:35:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:40,239 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 316 transitions. [2018-04-11 21:35:40,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 21:35:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 316 transitions. [2018-04-11 21:35:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:35:40,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:40,240 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-11 21:35:40,240 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-11 21:35:40,240 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-11 21:35:40,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:40,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:40,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,302 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-11 21:35:40,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:35:40,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 21:35:40,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:35:40,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:35:40,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:35:40,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:35:40,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2018-04-11 21:35:40,450 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-11 21:35:40,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, 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-11 21:35:40,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,481 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-11 21:35:40,492 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-11 21:35:40,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,511 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-11 21:35:40,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2018-04-11 21:35:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:40,555 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:40,997 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:40,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2018-04-11 21:35:40,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 21:35:40,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 21:35:40,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-04-11 21:35:40,998 INFO L87 Difference]: Start difference. First operand 280 states and 316 transitions. Second operand 15 states. [2018-04-11 21:35:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:41,974 INFO L93 Difference]: Finished difference Result 433 states and 478 transitions. [2018-04-11 21:35:41,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 21:35:41,974 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-11 21:35:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:41,976 INFO L225 Difference]: With dead ends: 433 [2018-04-11 21:35:41,976 INFO L226 Difference]: Without dead ends: 431 [2018-04-11 21:35:41,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2018-04-11 21:35:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-11 21:35:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 280. [2018-04-11 21:35:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-11 21:35:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 314 transitions. [2018-04-11 21:35:41,985 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 314 transitions. Word has length 35 [2018-04-11 21:35:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:41,986 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 314 transitions. [2018-04-11 21:35:41,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 21:35:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 314 transitions. [2018-04-11 21:35:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:35:41,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:41,986 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-11 21:35:41,987 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-11 21:35:41,987 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-11 21:35:41,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:42,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:42,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:42,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:42,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:42,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:42,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-11 21:35:42,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:35:42,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:35:42,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:35:42,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:35:42,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 21:35:42,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 21:35:42,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:35:42,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 21:35:42,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:35:42,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 21:35:42,364 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-11 21:35:42,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,368 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-11 21:35:42,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,387 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-11 21:35:42,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,391 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-11 21:35:42,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:7 [2018-04-11 21:35:42,409 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-11 21:35:42,409 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:42,452 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-11 21:35:42,472 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:42,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 9 [2018-04-11 21:35:42,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:35:42,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:35:42,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:35:42,473 INFO L87 Difference]: Start difference. First operand 280 states and 314 transitions. Second operand 9 states. [2018-04-11 21:35:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:42,765 INFO L93 Difference]: Finished difference Result 552 states and 612 transitions. [2018-04-11 21:35:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 21:35:42,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-04-11 21:35:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:42,766 INFO L225 Difference]: With dead ends: 552 [2018-04-11 21:35:42,766 INFO L226 Difference]: Without dead ends: 284 [2018-04-11 21:35:42,768 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-11 21:35:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-11 21:35:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 244. [2018-04-11 21:35:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-11 21:35:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-04-11 21:35:42,777 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 35 [2018-04-11 21:35:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:42,777 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-04-11 21:35:42,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:35:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-04-11 21:35:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 21:35:42,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:42,777 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-11 21:35:42,778 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-11 21:35:42,778 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-11 21:35:42,783 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:42,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:42,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,839 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-11 21:35:42,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:42,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:35:42,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:42,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 21:35:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:42,866 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:42,946 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:42,947 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2018-04-11 21:35:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:42,986 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:42,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-11 21:35:42,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:35:42,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:35:42,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:35:42,987 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 10 states. [2018-04-11 21:35:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:43,239 INFO L93 Difference]: Finished difference Result 272 states and 300 transitions. [2018-04-11 21:35:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:35:43,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-11 21:35:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:43,240 INFO L225 Difference]: With dead ends: 272 [2018-04-11 21:35:43,240 INFO L226 Difference]: Without dead ends: 270 [2018-04-11 21:35:43,240 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-11 21:35:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-11 21:35:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 242. [2018-04-11 21:35:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-11 21:35:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 266 transitions. [2018-04-11 21:35:43,246 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 266 transitions. Word has length 36 [2018-04-11 21:35:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:43,246 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 266 transitions. [2018-04-11 21:35:43,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:35:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2018-04-11 21:35:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 21:35:43,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:43,247 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-11 21:35:43,247 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-11 21:35:43,247 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-11 21:35:43,257 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:43,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:43,328 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-11 21:35:43,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 21:35:43,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:35:43,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:23 [2018-04-11 21:35:43,365 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-11 21:35:43,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 10 treesize of output 9 [2018-04-11 21:35:43,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,390 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-11 21:35:43,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 10 treesize of output 9 [2018-04-11 21:35:43,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,413 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-11 21:35:43,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:35:43,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,419 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 21:35:43,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:35:43,434 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,438 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,448 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-11 21:35:43,449 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:72, output treesize:41 [2018-04-11 21:35:43,478 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-11 21:35:43,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 21:35:43,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,497 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-11 21:35:43,499 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-11 21:35:43,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,512 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-11 21:35:43,514 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-11 21:35:43,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,518 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,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 28 treesize of output 24 [2018-04-11 21:35:43,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-11 21:35:43,531 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,534 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,540 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-11 21:35:43,541 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:77, output treesize:23 [2018-04-11 21:35:43,571 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-11 21:35:43,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:35:43,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,590 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-11 21:35:43,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:30 [2018-04-11 21:35:43,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:43,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:43,626 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-11 21:35:43,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:43,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2018-04-11 21:35:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:43,660 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:43,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, 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-11 21:35:43,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:43,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 21:35:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:47,872 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:47,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-11 21:35:47,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 21:35:47,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 21:35:47,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=325, Unknown=3, NotChecked=0, Total=380 [2018-04-11 21:35:47,873 INFO L87 Difference]: Start difference. First operand 242 states and 266 transitions. Second operand 20 states. [2018-04-11 21:35:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:49,025 INFO L93 Difference]: Finished difference Result 347 states and 376 transitions. [2018-04-11 21:35:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 21:35:49,025 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-04-11 21:35:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:49,026 INFO L225 Difference]: With dead ends: 347 [2018-04-11 21:35:49,026 INFO L226 Difference]: Without dead ends: 346 [2018-04-11 21:35:49,027 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-11 21:35:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-11 21:35:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 265. [2018-04-11 21:35:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-11 21:35:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 290 transitions. [2018-04-11 21:35:49,038 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 290 transitions. Word has length 38 [2018-04-11 21:35:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:49,038 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 290 transitions. [2018-04-11 21:35:49,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 21:35:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 290 transitions. [2018-04-11 21:35:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 21:35:49,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:49,039 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-11 21:35:49,040 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-11 21:35:49,040 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-11 21:35:49,053 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:49,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:49,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:49,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:35:49,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:49,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:49,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-11 21:35:49,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 21:35:49,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 21:35:49,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-11 21:35:49,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-11 21:35:49,102 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:49,124 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:49,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-11 21:35:49,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:35:49,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:35:49,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:35:49,125 INFO L87 Difference]: Start difference. First operand 265 states and 290 transitions. Second operand 5 states. [2018-04-11 21:35:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:49,278 INFO L93 Difference]: Finished difference Result 377 states and 412 transitions. [2018-04-11 21:35:49,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:35:49,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 21:35:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:49,279 INFO L225 Difference]: With dead ends: 377 [2018-04-11 21:35:49,280 INFO L226 Difference]: Without dead ends: 376 [2018-04-11 21:35:49,280 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-11 21:35:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-04-11 21:35:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 264. [2018-04-11 21:35:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-11 21:35:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 289 transitions. [2018-04-11 21:35:49,289 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 289 transitions. Word has length 38 [2018-04-11 21:35:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:49,289 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 289 transitions. [2018-04-11 21:35:49,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:35:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 289 transitions. [2018-04-11 21:35:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 21:35:49,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:49,290 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-11 21:35:49,290 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-11 21:35:49,291 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-11 21:35:49,299 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:49,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:49,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:49,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:35:49,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:49,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:49,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:49,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:49,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 21:35:49,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 21:35:49,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 21:35:49,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 21:35:49,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:35:49,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:49,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-11 21:35:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:49,618 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:49,665 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:49,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-11 21:35:49,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:35:49,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:35:49,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:35:49,666 INFO L87 Difference]: Start difference. First operand 264 states and 289 transitions. Second operand 8 states. [2018-04-11 21:35:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:50,026 INFO L93 Difference]: Finished difference Result 414 states and 451 transitions. [2018-04-11 21:35:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:35:50,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-04-11 21:35:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:50,028 INFO L225 Difference]: With dead ends: 414 [2018-04-11 21:35:50,028 INFO L226 Difference]: Without dead ends: 413 [2018-04-11 21:35:50,028 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-11 21:35:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-11 21:35:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 263. [2018-04-11 21:35:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-11 21:35:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 288 transitions. [2018-04-11 21:35:50,035 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 288 transitions. Word has length 38 [2018-04-11 21:35:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:50,035 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 288 transitions. [2018-04-11 21:35:50,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:35:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 288 transitions. [2018-04-11 21:35:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 21:35:50,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:50,036 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-11 21:35:50,036 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-11 21:35:50,036 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-11 21:35:50,048 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:50,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:50,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 6 treesize of output 5 [2018-04-11 21:35:50,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:35:50,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-11 21:35:50,077 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:50,099 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:50,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:50,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:50,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:50,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:50,100 INFO L87 Difference]: Start difference. First operand 263 states and 288 transitions. Second operand 4 states. [2018-04-11 21:35:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:50,194 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-04-11 21:35:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:50,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-04-11 21:35:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:50,195 INFO L225 Difference]: With dead ends: 281 [2018-04-11 21:35:50,195 INFO L226 Difference]: Without dead ends: 280 [2018-04-11 21:35:50,195 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-11 21:35:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-11 21:35:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2018-04-11 21:35:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-11 21:35:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 287 transitions. [2018-04-11 21:35:50,202 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 287 transitions. Word has length 40 [2018-04-11 21:35:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:50,202 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 287 transitions. [2018-04-11 21:35:50,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 287 transitions. [2018-04-11 21:35:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 21:35:50,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:50,203 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-11 21:35:50,203 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-11 21:35:50,203 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-11 21:35:50,211 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:50,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:50,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:50,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:35:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:50,243 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:50,276 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:50,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 21:35:50,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:35:50,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:35:50,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:35:50,278 INFO L87 Difference]: Start difference. First operand 262 states and 287 transitions. Second operand 6 states. [2018-04-11 21:35:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:50,427 INFO L93 Difference]: Finished difference Result 341 states and 368 transitions. [2018-04-11 21:35:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:35:50,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-11 21:35:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:50,429 INFO L225 Difference]: With dead ends: 341 [2018-04-11 21:35:50,429 INFO L226 Difference]: Without dead ends: 339 [2018-04-11 21:35:50,430 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-11 21:35:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-11 21:35:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 260. [2018-04-11 21:35:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 21:35:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2018-04-11 21:35:50,440 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 40 [2018-04-11 21:35:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:50,440 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2018-04-11 21:35:50,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:35:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2018-04-11 21:35:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:35:50,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:50,441 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-11 21:35:50,441 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-11 21:35:50,441 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-11 21:35:50,450 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:50,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:35:50,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:35:50,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-04-11 21:35:50,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 21:35:50,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 21:35:50,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-11 21:35:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:50,537 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:50,561 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:50,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-11 21:35:50,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:35:50,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:35:50,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:35:50,562 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 8 states. [2018-04-11 21:35:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:50,738 INFO L93 Difference]: Finished difference Result 433 states and 476 transitions. [2018-04-11 21:35:50,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 21:35:50,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-04-11 21:35:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:50,740 INFO L225 Difference]: With dead ends: 433 [2018-04-11 21:35:50,740 INFO L226 Difference]: Without dead ends: 432 [2018-04-11 21:35:50,741 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-11 21:35:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-04-11 21:35:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 286. [2018-04-11 21:35:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-11 21:35:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 320 transitions. [2018-04-11 21:35:50,753 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 320 transitions. Word has length 41 [2018-04-11 21:35:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:50,753 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 320 transitions. [2018-04-11 21:35:50,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:35:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2018-04-11 21:35:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:35:50,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:50,754 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-11 21:35:50,754 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-11 21:35:50,754 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-11 21:35:50,765 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:50,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:50,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:50,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:50,803 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-11 21:35:50,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 21:35:50,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:50,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:50,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 21:35:50,843 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-11 21:35:50,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 12 treesize of output 11 [2018-04-11 21:35:50,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:50,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 21:35:50,873 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-11 21:35:50,875 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-11 21:35:50,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:35:50,880 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,887 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-11 21:35:50,887 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 21:35:50,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-11 21:35:50,899 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:50,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 21:35:50,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:35:50,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,979 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-11 21:35:50,980 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-11 21:35:50,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,983 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-11 21:35:50,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:35:50,985 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,988 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:50,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:35:51,011 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-11 21:35:51,012 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2018-04-11 21:35:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:51,074 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:51,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-11 21:35:51,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 21:35:51,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 21:35:51,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:35:51,075 INFO L87 Difference]: Start difference. First operand 286 states and 320 transitions. Second operand 16 states. [2018-04-11 21:35:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:51,458 INFO L93 Difference]: Finished difference Result 344 states and 382 transitions. [2018-04-11 21:35:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:35:51,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 21:35:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:51,459 INFO L225 Difference]: With dead ends: 344 [2018-04-11 21:35:51,460 INFO L226 Difference]: Without dead ends: 343 [2018-04-11 21:35:51,460 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-11 21:35:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-11 21:35:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 285. [2018-04-11 21:35:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-11 21:35:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 319 transitions. [2018-04-11 21:35:51,468 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 319 transitions. Word has length 41 [2018-04-11 21:35:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:51,468 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 319 transitions. [2018-04-11 21:35:51,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 21:35:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 319 transitions. [2018-04-11 21:35:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:35:51,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:51,469 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-11 21:35:51,469 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-11 21:35:51,470 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-11 21:35:51,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:51,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35: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 6 treesize of output 5 [2018-04-11 21:35:51,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:51,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:51,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:35:51,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 21:35:51,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:51,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:51,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:51,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:51,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 21:35:51,604 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-11 21:35:51,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:35:51,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 21:35:51,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:35:51,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:51,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-11 21:35:51,659 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-11 21:35:51,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:35:51,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,668 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-11 21:35:51,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 21:35:51,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:35:51,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:35:51,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,694 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,697 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-11 21:35:51,698 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-11 21:35:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:51,710 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:51,856 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-11 21:35:51,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:35:51,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,896 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-11 21:35:51,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:35:51,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,905 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-11 21:35:51,908 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-11 21:35:51,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:35:51,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-11 21:35:51,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:35:51,994 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:51,999 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-11 21:35:52,000 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-11 21:35:52,001 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,002 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,005 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-11 21:35:52,007 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-11 21:35:52,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:35:52,020 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,025 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-11 21:35:52,027 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-11 21:35:52,028 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,029 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,032 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-11 21:35:52,034 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-11 21:35:52,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:35:52,048 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,095 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-11 21:35:52,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:35:52,097 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,098 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,101 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-11 21:35:52,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 21:35:52,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:35:52,135 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,142 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-11 21:35:52,143 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-11 21:35:52,143 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,145 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,148 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-11 21:35:52,166 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-11 21:35:52,166 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:97, output treesize:43 [2018-04-11 21:35:52,198 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-11 21:35:52,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-11 21:35:52,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-11 21:35:52,246 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:52,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-11 21:35:52,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 21:35:52,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 21:35:52,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:35:52,247 INFO L87 Difference]: Start difference. First operand 285 states and 319 transitions. Second operand 16 states. [2018-04-11 21:35:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:52,679 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2018-04-11 21:35:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:35:52,679 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 21:35:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:52,680 INFO L225 Difference]: With dead ends: 331 [2018-04-11 21:35:52,680 INFO L226 Difference]: Without dead ends: 330 [2018-04-11 21:35:52,681 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-11 21:35:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-11 21:35:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 284. [2018-04-11 21:35:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-11 21:35:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 318 transitions. [2018-04-11 21:35:52,692 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 318 transitions. Word has length 41 [2018-04-11 21:35:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:52,692 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 318 transitions. [2018-04-11 21:35:52,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 21:35:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 318 transitions. [2018-04-11 21:35:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:35:52,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:52,693 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-11 21:35:52,693 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-11 21:35:52,693 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-11 21:35:52,702 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:52,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:52,722 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:52,745 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:52,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:52,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:35:52,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:35:52,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:35:52,746 INFO L87 Difference]: Start difference. First operand 284 states and 318 transitions. Second operand 3 states. [2018-04-11 21:35:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:52,760 INFO L93 Difference]: Finished difference Result 503 states and 567 transitions. [2018-04-11 21:35:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:35:52,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-04-11 21:35:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:52,762 INFO L225 Difference]: With dead ends: 503 [2018-04-11 21:35:52,762 INFO L226 Difference]: Without dead ends: 286 [2018-04-11 21:35:52,762 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-11 21:35:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-11 21:35:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-04-11 21:35:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-11 21:35:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 320 transitions. [2018-04-11 21:35:52,772 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 320 transitions. Word has length 41 [2018-04-11 21:35:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:52,773 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 320 transitions. [2018-04-11 21:35:52,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:35:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2018-04-11 21:35:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 21:35:52,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:52,774 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-11 21:35:52,774 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-11 21:35:52,774 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-11 21:35:52,782 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:52,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:52,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:52,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:52,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:35:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:52,825 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:52,850 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:52,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 21:35:52,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:35:52,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:35:52,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:35:52,851 INFO L87 Difference]: Start difference. First operand 286 states and 320 transitions. Second operand 4 states. [2018-04-11 21:35:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:52,959 INFO L93 Difference]: Finished difference Result 299 states and 331 transitions. [2018-04-11 21:35:52,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:35:52,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-04-11 21:35:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:52,960 INFO L225 Difference]: With dead ends: 299 [2018-04-11 21:35:52,961 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 21:35:52,961 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-11 21:35:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 21:35:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 285. [2018-04-11 21:35:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-11 21:35:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 318 transitions. [2018-04-11 21:35:52,971 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 318 transitions. Word has length 43 [2018-04-11 21:35:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:52,971 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 318 transitions. [2018-04-11 21:35:52,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:35:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 318 transitions. [2018-04-11 21:35:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 21:35:52,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:52,972 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-11 21:35:52,972 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-11 21:35:52,973 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-11 21:35:52,984 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:53,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:53,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:35:53,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:35:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:53,025 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:53,068 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:53,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 21:35:53,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:35:53,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:35:53,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:35:53,069 INFO L87 Difference]: Start difference. First operand 285 states and 318 transitions. Second operand 6 states. [2018-04-11 21:35:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:53,203 INFO L93 Difference]: Finished difference Result 368 states and 404 transitions. [2018-04-11 21:35:53,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:35:53,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-04-11 21:35:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:53,204 INFO L225 Difference]: With dead ends: 368 [2018-04-11 21:35:53,204 INFO L226 Difference]: Without dead ends: 366 [2018-04-11 21:35:53,204 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-11 21:35:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-11 21:35:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 283. [2018-04-11 21:35:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-11 21:35:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2018-04-11 21:35:53,211 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 43 [2018-04-11 21:35:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:53,211 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2018-04-11 21:35:53,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:35:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2018-04-11 21:35:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 21:35:53,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:53,212 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-11 21:35:53,212 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-11 21:35:53,212 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-11 21:35:53,218 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:53,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:53,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 21:35:53,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:35:53,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 21:35:53,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:35:53,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 21:35:53,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-11 21:35:53,304 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:53,357 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:53,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2018-04-11 21:35:53,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:35:53,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:35:53,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:35:53,358 INFO L87 Difference]: Start difference. First operand 283 states and 314 transitions. Second operand 9 states. [2018-04-11 21:35:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:53,597 INFO L93 Difference]: Finished difference Result 602 states and 668 transitions. [2018-04-11 21:35:53,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 21:35:53,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-11 21:35:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:53,598 INFO L225 Difference]: With dead ends: 602 [2018-04-11 21:35:53,598 INFO L226 Difference]: Without dead ends: 331 [2018-04-11 21:35:53,599 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-11 21:35:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-11 21:35:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 281. [2018-04-11 21:35:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-11 21:35:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 310 transitions. [2018-04-11 21:35:53,605 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 310 transitions. Word has length 43 [2018-04-11 21:35:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:53,606 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 310 transitions. [2018-04-11 21:35:53,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:35:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 310 transitions. [2018-04-11 21:35:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 21:35:53,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:53,606 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-11 21:35:53,606 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-11 21:35:53,606 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-11 21:35:53,612 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:53,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:53,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:53,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:53,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:35:53,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,649 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-11 21:35:53,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 21:35:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:53,671 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:35:53,720 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-11 21:35:53,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:53,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-11 21:35:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:53,750 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:35:53,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-11 21:35:53,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:35:53,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:35:53,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:35:53,751 INFO L87 Difference]: Start difference. First operand 281 states and 310 transitions. Second operand 9 states. [2018-04-11 21:35:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:53,957 INFO L93 Difference]: Finished difference Result 325 states and 355 transitions. [2018-04-11 21:35:53,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:35:53,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-11 21:35:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:53,958 INFO L225 Difference]: With dead ends: 325 [2018-04-11 21:35:53,958 INFO L226 Difference]: Without dead ends: 322 [2018-04-11 21:35:53,958 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-11 21:35:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-11 21:35:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 293. [2018-04-11 21:35:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-11 21:35:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 323 transitions. [2018-04-11 21:35:53,967 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 323 transitions. Word has length 44 [2018-04-11 21:35:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:53,967 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 323 transitions. [2018-04-11 21:35:53,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:35:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 323 transitions. [2018-04-11 21:35:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 21:35:53,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:53,968 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-11 21:35:53,968 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-11 21:35:53,968 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-11 21:35:53,974 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:35:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:54,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:54,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:54,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:54,013 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-11 21:35:54,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 21:35:54,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:35:54,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:35:54,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 21:35:54,065 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-11 21:35:54,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:35:54,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:54,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 21:35:54,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 21:35:54,124 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-11 21:35:54,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:54,138 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-11 21:35:54,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-04-11 21:36:00,164 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-04-11 21:36:00,168 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-11 21:36:00,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:36:00,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:00,175 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-11 21:36:00,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:00,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:00,180 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-11 21:36:00,181 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-11 21:36:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:00,193 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:04,332 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-11 21:36:04,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:36:04,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,372 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-11 21:36:04,444 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-11 21:36:04,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,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 2 case distinctions, treesize of input 34 treesize of output 40 [2018-04-11 21:36:04,499 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:04,507 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-11 21:36:04,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:04,569 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-11 21:36:04,571 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-11 21:36:04,571 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,585 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-11 21:36:04,585 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:04,597 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:36:04,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:04,599 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-11 21:36:04,600 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-11 21:36:04,601 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,603 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:04,605 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-11 21:36:04,610 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-11 21:36:04,610 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:04,619 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:36:04,676 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-11 21:36:04,678 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-11 21:36:04,678 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,681 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,713 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-11 21:36:04,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:36:04,748 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-11 21:36:04,748 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 4 variables, input treesize:123, output treesize:25 [2018-04-11 21:36:04,796 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:04,796 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:21, output treesize:1 [2018-04-11 21:36:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:04,820 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:36:04,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-11 21:36:04,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 21:36:04,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 21:36:04,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=294, Unknown=4, NotChecked=0, Total=380 [2018-04-11 21:36:04,821 INFO L87 Difference]: Start difference. First operand 293 states and 323 transitions. Second operand 20 states. [2018-04-11 21:36:19,481 WARN L151 SmtUtils]: Spent 2021ms on a formula simplification. DAG size of input: 36 DAG size of output 32 [2018-04-11 21:36:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:25,819 INFO L93 Difference]: Finished difference Result 359 states and 394 transitions. [2018-04-11 21:36:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 21:36:25,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-11 21:36:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:25,821 INFO L225 Difference]: With dead ends: 359 [2018-04-11 21:36:25,821 INFO L226 Difference]: Without dead ends: 358 [2018-04-11 21:36:25,822 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-11 21:36:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-11 21:36:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 292. [2018-04-11 21:36:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-11 21:36:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 321 transitions. [2018-04-11 21:36:25,828 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 321 transitions. Word has length 44 [2018-04-11 21:36:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:25,828 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 321 transitions. [2018-04-11 21:36:25,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 21:36:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 321 transitions. [2018-04-11 21:36:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 21:36:25,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:25,829 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-11 21:36:25,829 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-11 21:36:25,829 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-11 21:36:25,835 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:25,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:25,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 6 treesize of output 5 [2018-04-11 21:36:25,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:25,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:25,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:36:25,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 21:36:25,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:36:25,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:36:25,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:36:25,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:36:25,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 21:36:25,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 21:36:25,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:36:25,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-11 21:36:25,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:36:25,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:25,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:25,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-11 21:36:25,998 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-11 21:36:26,003 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-11 21:36:26,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:26,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:26,039 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-11 21:36:26,043 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-11 21:36:26,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:26,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:26,057 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-11 21:36:26,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-04-11 21:36:30,089 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-11 21:36:30,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:36:30,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:30,109 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-11 21:36:30,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:30,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:30,124 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-11 21:36:30,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:36:30,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:30,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:36:30,132 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:30,133 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:30,137 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-11 21:36:30,138 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-11 21:36:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:30,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:34,604 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-11 21:36:34,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:36:34,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:34,632 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-11 21:36:34,634 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-11 21:36:34,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:34,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:34,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:34,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 243 treesize of output 157 [2018-04-11 21:36:34,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-11 21:36:34,668 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:34,688 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-11 21:36:34,805 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 98 DAG size of output 90 [2018-04-11 21:36:34,807 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-11 21:36:34,808 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:34,900 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-11 21:36:34,900 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:34,909 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-11 21:36:34,910 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:34,992 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-11 21:36:34,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:36:34,994 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,001 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-11 21:36:35,001 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,004 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,066 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-11 21:36:35,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, 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-11 21:36:35,074 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:35,086 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:36:35,087 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-11 21:36:35,089 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-11 21:36:35,090 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,094 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,096 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-11 21:36:35,101 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-11 21:36:35,102 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:35,109 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:36:35,170 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-11 21:36:35,195 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-11 21:36:35,227 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-11 21:36:35,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:36:35,243 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,254 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-11 21:36:35,256 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-11 21:36:35,273 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:35,274 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:35,274 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-11 21:36:35,274 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,280 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 21:36:35,292 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:35,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:35,302 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-11 21:36:35,315 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:35,316 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:35,316 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-11 21:36:35,316 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,320 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,327 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,328 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-11 21:36:35,329 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-11 21:36:35,329 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,332 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,338 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-11 21:36:35,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, 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-11 21:36:35,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:36:35,388 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,393 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-11 21:36:35,395 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-11 21:36:35,396 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,397 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,400 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-11 21:36:35,403 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-11 21:36:35,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 10 [2018-04-11 21:36:35,417 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,424 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-11 21:36:35,432 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-11 21:36:35,466 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-11 21:36:35,466 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,484 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-11 21:36:35,485 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-04-11 21:36:35,491 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,492 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,496 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-11 21:36:35,498 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-11 21:36:35,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 21:36:35,512 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,518 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-11 21:36:35,520 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-11 21:36:35,529 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-11 21:36:35,530 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,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 13 treesize of output 6 [2018-04-11 21:36:35,531 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,536 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,537 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,540 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-11 21:36:35,543 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-11 21:36:35,568 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-11 21:36:35,569 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,575 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-11 21:36:35,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, 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-11 21:36:35,576 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,578 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,581 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-11 21:36:35,605 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-11 21:36:35,605 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 10 variables, input treesize:367, output treesize:43 [2018-04-11 21:36:35,638 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-11 21:36:35,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-11 21:36:35,677 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:36:35,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:35,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2018-04-11 21:36:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:35,724 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:36:35,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-11 21:36:35,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 21:36:35,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 21:36:35,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=306, Unknown=4, NotChecked=0, Total=380 [2018-04-11 21:36:35,725 INFO L87 Difference]: Start difference. First operand 292 states and 321 transitions. Second operand 20 states. [2018-04-11 21:36:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:36,635 INFO L93 Difference]: Finished difference Result 339 states and 372 transitions. [2018-04-11 21:36:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:36:36,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-11 21:36:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:36,636 INFO L225 Difference]: With dead ends: 339 [2018-04-11 21:36:36,636 INFO L226 Difference]: Without dead ends: 338 [2018-04-11 21:36:36,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=236, Invalid=690, Unknown=4, NotChecked=0, Total=930 [2018-04-11 21:36:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-11 21:36:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 291. [2018-04-11 21:36:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-11 21:36:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 319 transitions. [2018-04-11 21:36:36,645 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 319 transitions. Word has length 44 [2018-04-11 21:36:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:36,646 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 319 transitions. [2018-04-11 21:36:36,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 21:36:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 319 transitions. [2018-04-11 21:36:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 21:36:36,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:36,647 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-11 21:36:36,647 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-11 21:36:36,647 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-11 21:36:36,658 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:36,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:36,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:36,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:36,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:36:36,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 21:36:36,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-04-11 21:36:36,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:36:36,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:36:36,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:36:36,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:36:36,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:35 [2018-04-11 21:36:36,754 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-11 21:36:36,756 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-11 21:36:36,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,766 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-11 21:36:36,767 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-11 21:36:36,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,773 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-11 21:36:36,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:17 [2018-04-11 21:36:36,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:36,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:36,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:36:36,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,829 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-11 21:36:36,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:36,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-04-11 21:36:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:36,878 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:36,934 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:36:36,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,940 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:36,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:36,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-11 21:36:36,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:36,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:36,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-04-11 21:36:37,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:37,077 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:37,078 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-11 21:36:37,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:36:37,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:37,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:37,087 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-11 21:36:37,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:6 [2018-04-11 21:36:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:37,129 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:36:37,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 21 [2018-04-11 21:36:37,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:36:37,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:36:37,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:36:37,130 INFO L87 Difference]: Start difference. First operand 291 states and 319 transitions. Second operand 22 states. [2018-04-11 21:36:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:56,382 INFO L93 Difference]: Finished difference Result 403 states and 434 transitions. [2018-04-11 21:36:56,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 21:36:56,383 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-04-11 21:36:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:56,384 INFO L225 Difference]: With dead ends: 403 [2018-04-11 21:36:56,384 INFO L226 Difference]: Without dead ends: 402 [2018-04-11 21:36:56,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 21:36:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-04-11 21:36:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 268. [2018-04-11 21:36:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 21:36:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2018-04-11 21:36:56,392 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 45 [2018-04-11 21:36:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:56,392 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2018-04-11 21:36:56,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:36:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2018-04-11 21:36:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 21:36:56,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:56,393 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-11 21:36:56,393 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-11 21:36:56,393 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-11 21:36:56,400 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:56,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:56,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:56,432 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-11 21:36:56,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:56,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:56,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:56,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:36:56,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:56,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:56,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 21:36:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:56,462 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:56,509 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:36:56,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:56,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:56,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:36:56,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-11 21:36:56,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:56,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:56,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-04-11 21:36:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:56,629 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:36:56,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-11 21:36:56,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:36:56,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:36:56,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:36:56,630 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 10 states. [2018-04-11 21:36:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:56,948 INFO L93 Difference]: Finished difference Result 355 states and 387 transitions. [2018-04-11 21:36:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 21:36:56,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-04-11 21:36:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:56,949 INFO L225 Difference]: With dead ends: 355 [2018-04-11 21:36:56,950 INFO L226 Difference]: Without dead ends: 354 [2018-04-11 21:36:56,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-04-11 21:36:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-11 21:36:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 268. [2018-04-11 21:36:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 21:36:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2018-04-11 21:36:56,961 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 46 [2018-04-11 21:36:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:56,961 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2018-04-11 21:36:56,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:36:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2018-04-11 21:36:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:36:56,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:56,963 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-11 21:36:56,963 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-11 21:36:56,963 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-11 21:36:56,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:56,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:57,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:36:57,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:36:57,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:57,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:57,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:57,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:41 [2018-04-11 21:36:57,100 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-11 21:36:57,103 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-11 21:36:57,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:57,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:57,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:57,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:23 [2018-04-11 21:36:57,174 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-11 21:36:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 21:36:57,182 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:57,281 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-11 21:36:57,329 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-11 21:36:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:57,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:36:57,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-04-11 21:36:57,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 21:36:57,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 21:36:57,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=374, Unknown=4, NotChecked=120, Total=552 [2018-04-11 21:36:57,362 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 24 states. [2018-04-11 21:36:57,387 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-11 21:36:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:58,631 INFO L93 Difference]: Finished difference Result 352 states and 382 transitions. [2018-04-11 21:36:58,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 21:36:58,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-04-11 21:36:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:58,632 INFO L225 Difference]: With dead ends: 352 [2018-04-11 21:36:58,632 INFO L226 Difference]: Without dead ends: 349 [2018-04-11 21:36:58,633 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=961, Unknown=10, NotChecked=268, Total=1406 [2018-04-11 21:36:58,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-11 21:36:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 298. [2018-04-11 21:36:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-11 21:36:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 325 transitions. [2018-04-11 21:36:58,642 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 325 transitions. Word has length 47 [2018-04-11 21:36:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:58,642 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 325 transitions. [2018-04-11 21:36:58,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 21:36:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 325 transitions. [2018-04-11 21:36:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:36:58,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:58,643 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:36:58,643 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-11 21:36:58,643 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-11 21:36:58,650 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:58,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:58,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:36:58,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:36:58,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:36:58,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:36:58,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-11 21:36:58,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:36:58,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:58,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:36:58,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:36:58,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:58,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:36:58,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 21:36:58,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 21:36:58,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:36:58,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 21:36:58,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:36:58,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:58,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 21:36:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:58,927 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:58,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:36:58,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-11 21:36:58,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:36:58,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:36:58,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:36:58,955 INFO L87 Difference]: Start difference. First operand 298 states and 325 transitions. Second operand 5 states. [2018-04-11 21:36:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:59,027 INFO L93 Difference]: Finished difference Result 372 states and 409 transitions. [2018-04-11 21:36:59,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:36:59,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-11 21:36:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:59,028 INFO L225 Difference]: With dead ends: 372 [2018-04-11 21:36:59,028 INFO L226 Difference]: Without dead ends: 304 [2018-04-11 21:36:59,029 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-11 21:36:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-11 21:36:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2018-04-11 21:36:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-11 21:36:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 322 transitions. [2018-04-11 21:36:59,038 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 322 transitions. Word has length 47 [2018-04-11 21:36:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:59,039 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 322 transitions. [2018-04-11 21:36:59,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:36:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 322 transitions. [2018-04-11 21:36:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:36:59,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:59,040 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-11 21:36:59,040 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-11 21:36:59,040 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-11 21:36:59,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:59,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:59,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:36:59,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:36:59,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:36:59,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:36:59,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-11 21:36:59,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 21:36:59,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-11 21:36:59,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-11 21:36:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:59,100 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:59,122 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:36:59,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-11 21:36:59,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:36:59,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:36:59,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:36:59,122 INFO L87 Difference]: Start difference. First operand 296 states and 322 transitions. Second operand 5 states. [2018-04-11 21:36:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:59,275 INFO L93 Difference]: Finished difference Result 415 states and 450 transitions. [2018-04-11 21:36:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:36:59,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-11 21:36:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:59,277 INFO L225 Difference]: With dead ends: 415 [2018-04-11 21:36:59,277 INFO L226 Difference]: Without dead ends: 414 [2018-04-11 21:36:59,277 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-11 21:36:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-11 21:36:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 295. [2018-04-11 21:36:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-11 21:36:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 321 transitions. [2018-04-11 21:36:59,286 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 321 transitions. Word has length 47 [2018-04-11 21:36:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:59,286 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 321 transitions. [2018-04-11 21:36:59,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:36:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 321 transitions. [2018-04-11 21:36:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:36:59,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:59,287 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-11 21:36:59,287 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-11 21:36:59,287 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-11 21:36:59,292 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:59,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:59,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:36:59,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 21:36:59,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:36:59,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:36:59,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:36:59,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:36:59,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-11 21:36:59,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 21:36:59,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-11 21:36:59,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 21:36:59,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 21:36:59,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-11 21:36:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:59,359 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:59,401 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:36:59,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-11 21:36:59,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:36:59,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:36:59,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:36:59,401 INFO L87 Difference]: Start difference. First operand 295 states and 321 transitions. Second operand 8 states. [2018-04-11 21:36:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:59,673 INFO L93 Difference]: Finished difference Result 432 states and 468 transitions. [2018-04-11 21:36:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:36:59,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-11 21:36:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:59,693 INFO L225 Difference]: With dead ends: 432 [2018-04-11 21:36:59,693 INFO L226 Difference]: Without dead ends: 431 [2018-04-11 21:36:59,693 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-11 21:36:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-11 21:36:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 294. [2018-04-11 21:36:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-11 21:36:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 320 transitions. [2018-04-11 21:36:59,702 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 320 transitions. Word has length 47 [2018-04-11 21:36:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:59,702 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 320 transitions. [2018-04-11 21:36:59,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:36:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 320 transitions. [2018-04-11 21:36:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:36:59,702 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:59,702 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-11 21:36:59,702 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-11 21:36:59,703 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-11 21:36:59,708 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:36:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:59,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:59,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:59,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:59,733 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-11 21:36:59,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 21:36:59,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:36:59,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 10 treesize of output 9 [2018-04-11 21:36:59,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-11 21:36:59,772 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-11 21:36:59,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:36:59,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:59,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-11 21:36:59,798 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-11 21:36:59,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:36:59,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,803 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-11 21:36:59,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,809 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-11 21:36:59,810 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-11 21:36:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:59,820 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:36:59,860 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-11 21:36:59,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 11 treesize of output 10 [2018-04-11 21:36:59,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 21:36:59,885 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-11 21:36:59,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,888 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-11 21:36:59,889 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-11 21:36:59,889 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,892 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:59,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:36:59,912 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-11 21:36:59,912 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-04-11 21:36:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:59,973 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:36:59,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-11 21:36:59,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 21:36:59,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 21:36:59,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:36:59,974 INFO L87 Difference]: Start difference. First operand 294 states and 320 transitions. Second operand 16 states. [2018-04-11 21:37:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:00,302 INFO L93 Difference]: Finished difference Result 321 states and 349 transitions. [2018-04-11 21:37:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:37:00,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 21:37:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:00,303 INFO L225 Difference]: With dead ends: 321 [2018-04-11 21:37:00,304 INFO L226 Difference]: Without dead ends: 320 [2018-04-11 21:37:00,304 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 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-11 21:37:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-11 21:37:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 293. [2018-04-11 21:37:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-11 21:37:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 319 transitions. [2018-04-11 21:37:00,312 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 319 transitions. Word has length 50 [2018-04-11 21:37:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:00,313 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 319 transitions. [2018-04-11 21:37:00,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 21:37:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 319 transitions. [2018-04-11 21:37:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:37:00,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:00,313 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-11 21:37:00,313 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-11 21:37:00,313 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-11 21:37:00,326 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:00,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:00,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:00,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:00,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:37:00,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,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, 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-11 21:37:00,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 21:37:00,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:37:00,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:37:00,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:37:00,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:37:00,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-11 21:37:00,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 21:37:00,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:37:00,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,427 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-11 21:37:00,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 14 treesize of output 13 [2018-04-11 21:37:00,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:00,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-11 21:37:00,456 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-11 21:37:00,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 5 treesize of output 1 [2018-04-11 21:37:00,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,463 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-11 21:37:00,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,475 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-11 21:37:00,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:37:00,477 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 21:37:00,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,485 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-11 21:37:00,485 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-04-11 21:37:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:00,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:00,583 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-11 21:37:00,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-11 21:37:00,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,614 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-11 21:37:00,616 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-11 21:37:00,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,620 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-11 21:37:00,622 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-11 21:37:00,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,628 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:37:00,666 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-11 21:37:00,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 21:37:00,683 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,689 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-11 21:37:00,690 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-11 21:37:00,690 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,691 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,694 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-11 21:37:00,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 21:37:00,711 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-11 21:37:00,711 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,716 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-11 21:37:00,718 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-11 21:37:00,718 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,719 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,722 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-11 21:37:00,724 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-11 21:37:00,738 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-11 21:37:00,738 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,743 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-11 21:37:00,744 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-11 21:37:00,745 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,746 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,748 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-11 21:37:00,766 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-11 21:37:00,781 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-11 21:37:00,782 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 21:37:00,790 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-11 21:37:00,790 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,791 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,795 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-11 21:37:00,812 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-11 21:37:00,812 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:115, output treesize:43 [2018-04-11 21:37:00,841 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-11 21:37:00,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:00,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-11 21:37:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:00,888 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:00,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-11 21:37:00,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 21:37:00,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 21:37:00,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:37:00,889 INFO L87 Difference]: Start difference. First operand 293 states and 319 transitions. Second operand 16 states. [2018-04-11 21:37:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:01,330 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2018-04-11 21:37:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:37:01,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 21:37:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:01,331 INFO L225 Difference]: With dead ends: 308 [2018-04-11 21:37:01,331 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 21:37:01,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 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-11 21:37:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 21:37:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 292. [2018-04-11 21:37:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-11 21:37:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 318 transitions. [2018-04-11 21:37:01,340 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 318 transitions. Word has length 50 [2018-04-11 21:37:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:01,340 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 318 transitions. [2018-04-11 21:37:01,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 21:37:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 318 transitions. [2018-04-11 21:37:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:37:01,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:01,341 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-11 21:37:01,341 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-11 21:37:01,341 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-11 21:37:01,347 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:01,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:01,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:01,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:01,372 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-11 21:37:01,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 21:37:01,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:37:01,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:37:01,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-11 21:37:01,410 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-11 21:37:01,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:37:01,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:01,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-11 21:37:01,451 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-11 21:37:01,454 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-11 21:37:01,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:01,467 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-11 21:37:01,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-04-11 21:37:05,495 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-11 21:37:05,497 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-11 21:37:05,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:37:05,501 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,507 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-11 21:37:05,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 21:37:05,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-11 21:37:05,520 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:05,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, 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-11 21:37:05,643 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-11 21:37:05,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 21:37:05,655 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-11 21:37:05,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-11 21:37:05,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-11 21:37:05,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:37:05,683 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-11 21:37:05,684 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-04-11 21:37:05,725 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:05,725 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:21, output treesize:1 [2018-04-11 21:37:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:05,750 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:05,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2018-04-11 21:37:05,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 21:37:05,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 21:37:05,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=267, Unknown=2, NotChecked=0, Total=342 [2018-04-11 21:37:05,751 INFO L87 Difference]: Start difference. First operand 292 states and 318 transitions. Second operand 19 states. [2018-04-11 21:37:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:24,616 INFO L93 Difference]: Finished difference Result 319 states and 347 transitions. [2018-04-11 21:37:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 21:37:24,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-11 21:37:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:24,618 INFO L225 Difference]: With dead ends: 319 [2018-04-11 21:37:24,618 INFO L226 Difference]: Without dead ends: 318 [2018-04-11 21:37:24,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=296, Invalid=751, Unknown=9, NotChecked=0, Total=1056 [2018-04-11 21:37:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-11 21:37:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-04-11 21:37:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-11 21:37:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 317 transitions. [2018-04-11 21:37:24,627 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 317 transitions. Word has length 53 [2018-04-11 21:37:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:24,627 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 317 transitions. [2018-04-11 21:37:24,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 21:37:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2018-04-11 21:37:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:37:24,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:24,628 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-11 21:37:24,628 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-11 21:37:24,628 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-11 21:37:24,633 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:24,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:24,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:37:24,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:24,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:24,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:37:24,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 21:37:24,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:37:24,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:37:24,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:37:24,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 10 treesize of output 9 [2018-04-11 21:37:24,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-04-11 21:37:24,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 21:37:24,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:37:24,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,739 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-11 21:37:24,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:37:24,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:24,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-11 21:37:24,791 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-11 21:37:24,794 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-11 21:37:24,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,818 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-11 21:37:24,823 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-11 21:37:24,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:24,842 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-11 21:37:24,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:87 [2018-04-11 21:37:28,874 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-11 21:37:28,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 21:37:28,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:28,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:37:28,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:28,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:28,898 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-11 21:37:28,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 21:37:28,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:28,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:37:28,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:28,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:28,908 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-11 21:37:28,909 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:9 [2018-04-11 21:37:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:28,921 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:29,194 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-11 21:37:29,211 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-11 21:37:29,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,228 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-11 21:37:29,229 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-11 21:37:29,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-11 21:37:29,235 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-11 21:37:29,235 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:37:29,277 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-11 21:37:29,291 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-11 21:37:29,291 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 21:37:29,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 18 treesize of output 5 [2018-04-11 21:37:29,299 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,300 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,304 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-11 21:37:29,330 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-11 21:37:29,345 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-11 21:37:29,345 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,351 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-11 21:37:29,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-11 21:37:29,353 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,354 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,357 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-11 21:37:29,360 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-11 21:37:29,387 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-11 21:37:29,387 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,393 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-11 21:37:29,394 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-11 21:37:29,394 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,396 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,399 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-11 21:37:29,401 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-11 21:37:29,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 21:37:29,417 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,423 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-11 21:37:29,424 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-11 21:37:29,425 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,426 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,429 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-11 21:37:29,447 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-11 21:37:29,448 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:121, output treesize:43 [2018-04-11 21:37:29,482 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-11 21:37:29,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-11 21:37:29,557 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:37:29,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:29,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2018-04-11 21:37:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:29,584 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:29,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2018-04-11 21:37:29,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 21:37:29,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 21:37:29,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=279, Unknown=2, NotChecked=0, Total=342 [2018-04-11 21:37:29,585 INFO L87 Difference]: Start difference. First operand 291 states and 317 transitions. Second operand 19 states. [2018-04-11 21:37:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:30,148 INFO L93 Difference]: Finished difference Result 306 states and 334 transitions. [2018-04-11 21:37:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:37:30,148 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-11 21:37:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:30,149 INFO L225 Difference]: With dead ends: 306 [2018-04-11 21:37:30,149 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 21:37:30,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=221, Invalid=647, Unknown=2, NotChecked=0, Total=870 [2018-04-11 21:37:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 21:37:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2018-04-11 21:37:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-11 21:37:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 316 transitions. [2018-04-11 21:37:30,164 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 316 transitions. Word has length 53 [2018-04-11 21:37:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:30,164 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 316 transitions. [2018-04-11 21:37:30,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 21:37:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 316 transitions. [2018-04-11 21:37:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:37:30,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:30,164 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-11 21:37:30,164 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-11 21:37:30,165 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-11 21:37:30,170 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:30,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:30,199 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-11 21:37:30,199 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:30,203 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-11 21:37:30,222 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:30,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 21:37:30,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:37:30,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:37:30,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:37:30,223 INFO L87 Difference]: Start difference. First operand 290 states and 316 transitions. Second operand 5 states. [2018-04-11 21:37:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:30,283 INFO L93 Difference]: Finished difference Result 410 states and 444 transitions. [2018-04-11 21:37:30,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:37:30,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-11 21:37:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:30,285 INFO L225 Difference]: With dead ends: 410 [2018-04-11 21:37:30,285 INFO L226 Difference]: Without dead ends: 407 [2018-04-11 21:37:30,285 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-11 21:37:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-11 21:37:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 296. [2018-04-11 21:37:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-11 21:37:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 323 transitions. [2018-04-11 21:37:30,295 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 323 transitions. Word has length 54 [2018-04-11 21:37:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:30,295 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 323 transitions. [2018-04-11 21:37:30,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:37:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 323 transitions. [2018-04-11 21:37:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:37:30,295 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:30,296 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-11 21:37:30,296 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-11 21:37:30,296 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-11 21:37:30,301 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:30,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:30,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:30,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:30,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:37:30,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 21:37:30,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:30,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 21:37:30,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:30,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 21:37:30,360 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-11 21:37:30,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:30,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:37:30,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 21:37:30,388 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-11 21:37:30,407 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:30,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2018-04-11 21:37:30,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:37:30,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:37:30,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:37:30,408 INFO L87 Difference]: Start difference. First operand 296 states and 323 transitions. Second operand 10 states. [2018-04-11 21:37:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:30,663 INFO L93 Difference]: Finished difference Result 349 states and 375 transitions. [2018-04-11 21:37:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 21:37:30,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-11 21:37:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:30,664 INFO L225 Difference]: With dead ends: 349 [2018-04-11 21:37:30,664 INFO L226 Difference]: Without dead ends: 347 [2018-04-11 21:37:30,664 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-11 21:37:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-11 21:37:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 301. [2018-04-11 21:37:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-04-11 21:37:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 329 transitions. [2018-04-11 21:37:30,674 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 329 transitions. Word has length 54 [2018-04-11 21:37:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:30,674 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 329 transitions. [2018-04-11 21:37:30,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:37:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 329 transitions. [2018-04-11 21:37:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:37:30,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:30,675 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-11 21:37:30,675 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-11 21:37:30,675 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-11 21:37:30,680 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:30,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:30,735 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-11 21:37:30,735 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:30,749 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 21:37:30,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,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, 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-11 21:37:30,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:30,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:10 [2018-04-11 21:37:30,765 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-11 21:37:30,784 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:30,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-11 21:37:30,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:37:30,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:37:30,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:37:30,784 INFO L87 Difference]: Start difference. First operand 301 states and 329 transitions. Second operand 9 states. [2018-04-11 21:37:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:31,050 INFO L93 Difference]: Finished difference Result 478 states and 508 transitions. [2018-04-11 21:37:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 21:37:31,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-11 21:37:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:31,052 INFO L225 Difference]: With dead ends: 478 [2018-04-11 21:37:31,052 INFO L226 Difference]: Without dead ends: 476 [2018-04-11 21:37:31,052 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-11 21:37:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-04-11 21:37:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 304. [2018-04-11 21:37:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-11 21:37:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 330 transitions. [2018-04-11 21:37:31,062 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 330 transitions. Word has length 54 [2018-04-11 21:37:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:31,062 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 330 transitions. [2018-04-11 21:37:31,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:37:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 330 transitions. [2018-04-11 21:37:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:37:31,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:31,063 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-11 21:37:31,063 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-11 21:37:31,063 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-11 21:37:31,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:31,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:31,097 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-11 21:37:31,097 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:31,101 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-11 21:37:31,120 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:31,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 21:37:31,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:37:31,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:37:31,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:37:31,120 INFO L87 Difference]: Start difference. First operand 304 states and 330 transitions. Second operand 5 states. [2018-04-11 21:37:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:31,175 INFO L93 Difference]: Finished difference Result 400 states and 429 transitions. [2018-04-11 21:37:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:37:31,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-11 21:37:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:31,177 INFO L225 Difference]: With dead ends: 400 [2018-04-11 21:37:31,177 INFO L226 Difference]: Without dead ends: 397 [2018-04-11 21:37:31,177 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-11 21:37:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-11 21:37:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 304. [2018-04-11 21:37:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-11 21:37:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-04-11 21:37:31,187 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 54 [2018-04-11 21:37:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:31,187 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-04-11 21:37:31,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:37:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-04-11 21:37:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:37:31,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:31,188 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-11 21:37:31,188 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-11 21:37:31,188 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-11 21:37:31,193 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:31,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:31,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:31,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:31,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:37:31,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:31,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:31,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 21:37:31,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:31,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 21:37:31,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:31,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:31,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 21:37:31,249 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-11 21:37:31,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:31,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 21:37:31,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:31,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:31,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 21:37:31,270 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-11 21:37:31,289 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:31,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2018-04-11 21:37:31,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:37:31,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:37:31,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:37:31,289 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 10 states. [2018-04-11 21:37:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:31,516 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2018-04-11 21:37:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:37:31,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-11 21:37:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:31,517 INFO L225 Difference]: With dead ends: 315 [2018-04-11 21:37:31,517 INFO L226 Difference]: Without dead ends: 313 [2018-04-11 21:37:31,517 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-11 21:37:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-11 21:37:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 304. [2018-04-11 21:37:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-11 21:37:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 327 transitions. [2018-04-11 21:37:31,534 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 327 transitions. Word has length 54 [2018-04-11 21:37:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:31,534 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 327 transitions. [2018-04-11 21:37:31,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:37:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 327 transitions. [2018-04-11 21:37:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 21:37:31,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:31,535 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-11 21:37:31,535 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-11 21:37:31,536 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-11 21:37:31,541 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:31,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:31,580 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-11 21:37:31,580 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:31,584 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-11 21:37:31,603 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:31,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-11 21:37:31,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:37:31,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:37:31,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:37:31,604 INFO L87 Difference]: Start difference. First operand 304 states and 327 transitions. Second operand 5 states. [2018-04-11 21:37:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:31,656 INFO L93 Difference]: Finished difference Result 395 states and 424 transitions. [2018-04-11 21:37:31,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:37:31,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-04-11 21:37:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:31,658 INFO L225 Difference]: With dead ends: 395 [2018-04-11 21:37:31,658 INFO L226 Difference]: Without dead ends: 394 [2018-04-11 21:37:31,658 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-11 21:37:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-11 21:37:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2018-04-11 21:37:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-11 21:37:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 315 transitions. [2018-04-11 21:37:31,668 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 315 transitions. Word has length 60 [2018-04-11 21:37:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:31,668 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 315 transitions. [2018-04-11 21:37:31,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:37:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 315 transitions. [2018-04-11 21:37:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 21:37:31,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:31,668 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-11 21:37:31,669 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-11 21:37:31,669 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-11 21:37:31,674 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:31,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:31,729 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-11 21:37:31,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:31,760 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-11 21:37:31,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 21:37:31,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:37:31,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-04-11 21:37:31,803 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-11 21:37:31,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:37:31,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-04-11 21:37:31,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 21:37:31,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 21:37:31,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 21:37:31,823 INFO L87 Difference]: Start difference. First operand 293 states and 315 transitions. Second operand 14 states. [2018-04-11 21:37:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:32,303 INFO L93 Difference]: Finished difference Result 591 states and 637 transitions. [2018-04-11 21:37:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 21:37:32,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-11 21:37:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:32,305 INFO L225 Difference]: With dead ends: 591 [2018-04-11 21:37:32,305 INFO L226 Difference]: Without dead ends: 589 [2018-04-11 21:37:32,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-04-11 21:37:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-11 21:37:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 303. [2018-04-11 21:37:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-11 21:37:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 326 transitions. [2018-04-11 21:37:32,317 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 326 transitions. Word has length 62 [2018-04-11 21:37:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:32,317 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 326 transitions. [2018-04-11 21:37:32,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 21:37:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 326 transitions. [2018-04-11 21:37:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 21:37:32,318 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:32,318 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-11 21:37:32,318 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-11 21:37:32,318 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-11 21:37:32,323 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:37:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:32,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:32,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:37:32,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:37:32,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:37:32,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:37:32,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-11 21:37:32,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:37:32,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,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-11 21:37:32,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:37:32,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:37:32,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-11 21:37:32,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 21:37:32,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:37:32,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 21:37:32,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:37:32,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-04-11 21:37:32,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:37:32,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:55 [2018-04-11 21:37:32,532 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-11 21:37:32,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:37:32,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,572 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-11 21:37:32,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 8 treesize of output 7 [2018-04-11 21:37:32,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-04-11 21:37:32,619 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-11 21:37:32,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,623 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-11 21:37:32,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,656 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-11 21:37:32,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:37:32,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:32,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:147 [2018-04-11 21:37:32,980 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-11 21:37:32,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:32,986 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-11 21:37:32,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:33,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:33,009 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-11 21:37:33,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:33,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:33,039 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-11 21:37:33,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:33,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:33,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:33,044 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-11 21:37:33,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:33,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:37:33,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:33,056 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:33,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:33,061 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:185, output treesize:7 [2018-04-11 21:37:33,112 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-11 21:37:33,112 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:37:34,124 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-11 21:37:34,143 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:37:34,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 11] imperfect sequences [] total 21 [2018-04-11 21:37:34,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 21:37:34,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 21:37:34,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-04-11 21:37:34,144 INFO L87 Difference]: Start difference. First operand 303 states and 326 transitions. Second operand 21 states. [2018-04-11 21:38:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:38:32,126 INFO L93 Difference]: Finished difference Result 417 states and 447 transitions. [2018-04-11 21:38:32,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 21:38:32,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-04-11 21:38:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:38:32,152 INFO L225 Difference]: With dead ends: 417 [2018-04-11 21:38:32,152 INFO L226 Difference]: Without dead ends: 332 [2018-04-11 21:38:32,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 21:38:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-11 21:38:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 303. [2018-04-11 21:38:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-11 21:38:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 325 transitions. [2018-04-11 21:38:32,162 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 325 transitions. Word has length 63 [2018-04-11 21:38:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:38:32,162 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 325 transitions. [2018-04-11 21:38:32,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 21:38:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 325 transitions. [2018-04-11 21:38:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 21:38:32,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:38:32,163 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-11 21:38:32,163 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-11 21:38:32,163 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-11 21:38:32,172 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:38:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:38:32,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:38:32,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:38:32,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:38:32,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:38:32,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:38:32,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 21:38:32,249 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-11 21:38:32,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,251 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-11 21:38:32,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,266 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-11 21:38:32,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,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, 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-11 21:38:32,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-11 21:38:32,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:38:32,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-04-11 21:38:32,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 21:38:32,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:38:32,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,348 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-11 21:38:32,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:38:32,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:58 [2018-04-11 21:38:32,387 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-11 21:38:32,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,391 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-11 21:38:32,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2018-04-11 21:38:32,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:38:32,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:118 [2018-04-11 21:38:32,583 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-11 21:38:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,586 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:38:32,586 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-11 21:38:32,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,599 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-11 21:38:32,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:38:32,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:38:32,621 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-11 21:38:32,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,624 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:38:32,624 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-11 21:38:32,624 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:32,633 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:38:32,633 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-11 21:38:32,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:32,641 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-11 21:38:32,641 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:160, output treesize:7 [2018-04-11 21:38:32,667 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-11 21:38:32,667 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:38:34,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-11 21:38:34,393 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-11 21:38:34,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,405 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-11 21:38:34,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, 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-11 21:38:34,418 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-11 21:38:34,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:38:34,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 21:38:34,420 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,430 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:38:34,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:38:34,447 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-11 21:38:34,449 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:38:34,451 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-11 21:38:34,469 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-11 21:38:34,470 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,475 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:38:34,502 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:38:34,503 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-11 21:38:34,505 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-11 21:38:34,505 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,507 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,525 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-11 21:38:34,563 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-11 21:38:34,577 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-11 21:38:34,578 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 21:38:34,593 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-11 21:38:34,603 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-11 21:38:34,604 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:38:34,605 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-11 21:38:34,605 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,615 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:38:34,624 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:38:34,630 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-11 21:38:34,632 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 34 treesize of output 37 [2018-04-11 21:38:34,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-04-11 21:38:34,645 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,646 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 4 [2018-04-11 21:38:34,646 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,654 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,665 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 24 treesize of output 19 [2018-04-11 21:38:34,666 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:38:34,677 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-11 21:38:34,695 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-11 21:38:34,695 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,699 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,704 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,705 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-11 21:38:34,707 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-11 21:38:34,707 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,709 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:34,726 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-11 21:38:34,775 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-11 21:38:34,775 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 8 variables, input treesize:111, output treesize:85 [2018-04-11 21:38:34,862 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-11 21:38:34,881 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:38:34,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 26 [2018-04-11 21:38:34,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 21:38:34,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 21:38:34,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-04-11 21:38:34,882 INFO L87 Difference]: Start difference. First operand 303 states and 325 transitions. Second operand 26 states. [2018-04-11 21:39:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:39:24,723 INFO L93 Difference]: Finished difference Result 402 states and 430 transitions. [2018-04-11 21:39:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 21:39:24,723 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-04-11 21:39:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:39:24,724 INFO L225 Difference]: With dead ends: 402 [2018-04-11 21:39:24,724 INFO L226 Difference]: Without dead ends: 302 [2018-04-11 21:39:24,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=392, Invalid=1678, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 21:39:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-11 21:39:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 279. [2018-04-11 21:39:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 21:39:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 300 transitions. [2018-04-11 21:39:24,734 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 300 transitions. Word has length 63 [2018-04-11 21:39:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:39:24,734 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 300 transitions. [2018-04-11 21:39:24,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 21:39:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 300 transitions. [2018-04-11 21:39:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 21:39:24,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:39:24,735 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-11 21:39:24,735 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-11 21:39:24,735 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-11 21:39:24,740 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:39:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:39:24,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:39:24,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:39:24,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:39:24,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:39:24,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:39:24,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-11 21:39:24,796 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-11 21:39:24,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,799 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-11 21:39:24,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 21:39:24,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,814 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-11 21:39:24,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-11 21:39:24,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:39:24,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:39:24,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2018-04-11 21:39:24,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 21:39:24,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,903 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-11 21:39:24,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,931 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-11 21:39:24,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:24,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:39:24,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:24,957 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-11 21:39:24,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:54 [2018-04-11 21:39:24,997 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-11 21:39:24,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:39:24,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,023 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-11 21:39:25,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:39:25,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,049 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-11 21:39:25,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:76 [2018-04-11 21:39:25,115 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-11 21:39:25,119 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-11 21:39:25,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,156 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-11 21:39:25,159 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-11 21:39:25,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:25,182 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-11 21:39:25,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:118, output treesize:102 [2018-04-11 21:39:26,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-11 21:39:26,028 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:39:26,029 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-11 21:39:26,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:26,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:26,061 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-11 21:39:26,070 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-11 21:39:26,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 21:39:26,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:39:26,119 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-11 21:39:26,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:187 [2018-04-11 21:39:37,492 WARN L148 SmtUtils]: Spent 11338ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-11 21:39:37,500 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-11 21:39:37,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,503 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:39:37,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,507 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-11 21:39:37,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:39:37,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:39:37,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:39:37,577 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-11 21:39:37,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-04-11 21:39:37,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,606 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:39:37,606 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-11 21:39:37,606 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,652 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-11 21:39:37,658 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-11 21:39:37,658 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 21:39:37,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,674 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:39:37,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,677 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-11 21:39:37,677 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:39:37,720 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-11 21:39:37,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:37,722 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:39:37,722 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-11 21:39:37,722 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:39:37,732 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,738 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:37,761 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-11 21:39:37,761 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:223, output treesize:7 [2018-04-11 21:39:37,808 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-11 21:39:37,808 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:39:38,516 WARN L148 SmtUtils]: Spent 602ms on a formula simplification that was a NOOP. DAG size: 28 [2018-04-11 21:39:41,292 WARN L148 SmtUtils]: Spent 250ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 21:39:47,962 WARN L148 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 59 Received shutdown request... [2018-04-11 21:40:00,535 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 21:40:00,535 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 21:40:00,540 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 21:40:00,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 09:40:00 BoogieIcfgContainer [2018-04-11 21:40:00,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 21:40:00,541 INFO L168 Benchmark]: Toolchain (without parser) took 266996.15 ms. Allocated memory was 306.7 MB in the beginning and 591.9 MB in the end (delta: 285.2 MB). Free memory was 244.4 MB in the beginning and 311.7 MB in the end (delta: -67.3 MB). Peak memory consumption was 217.9 MB. Max. memory is 5.3 GB. [2018-04-11 21:40:00,542 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 306.7 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 21:40:00,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.55 ms. Allocated memory is still 306.7 MB. Free memory was 244.4 MB in the beginning and 218.2 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-04-11 21:40:00,542 INFO L168 Benchmark]: Boogie Preprocessor took 61.13 ms. Allocated memory is still 306.7 MB. Free memory was 218.2 MB in the beginning and 216.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-11 21:40:00,542 INFO L168 Benchmark]: RCFGBuilder took 770.29 ms. Allocated memory was 306.7 MB in the beginning and 471.9 MB in the end (delta: 165.2 MB). Free memory was 216.2 MB in the beginning and 383.1 MB in the end (delta: -166.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-04-11 21:40:00,542 INFO L168 Benchmark]: TraceAbstraction took 265829.90 ms. Allocated memory was 471.9 MB in the beginning and 591.9 MB in the end (delta: 120.1 MB). Free memory was 383.1 MB in the beginning and 311.7 MB in the end (delta: 71.5 MB). Peak memory consumption was 191.5 MB. Max. memory is 5.3 GB. [2018-04-11 21:40:00,544 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.19 ms. Allocated memory is still 306.7 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 330.55 ms. Allocated memory is still 306.7 MB. Free memory was 244.4 MB in the beginning and 218.2 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 61.13 ms. Allocated memory is still 306.7 MB. Free memory was 218.2 MB in the beginning and 216.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 770.29 ms. Allocated memory was 306.7 MB in the beginning and 471.9 MB in the end (delta: 165.2 MB). Free memory was 216.2 MB in the beginning and 383.1 MB in the end (delta: -166.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 265829.90 ms. Allocated memory was 471.9 MB in the beginning and 591.9 MB in the end (delta: 120.1 MB). Free memory was 383.1 MB in the beginning and 311.7 MB in the end (delta: 71.5 MB). Peak memory consumption was 191.5 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 analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 210 locations, 75 error locations. TIMEOUT Result, 265.7s OverallTime, 52 OverallIterations, 3 TraceHistogramMax, 181.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8357 SDtfs, 14416 SDslu, 30989 SDs, 0 SdLazy, 17695 SolverSat, 890 SolverUnsat, 82 SolverUnknown, 0 SolverNotchecked, 141.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4403 GetRequests, 3671 SyntacticMatches, 20 SemanticMatches, 712 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2709 ImplicationChecksByTransitivity, 74.2s 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, 3029 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 45.5s InterpolantComputationTime, 2068 NumberOfCodeBlocks, 2068 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4034 ConstructedInterpolants, 281 QuantifiedInterpolants, 1572536 SizeOfPredicates, 404 NumberOfNonLiveVariables, 7204 ConjunctsInSsa, 624 ConjunctsInUnsatCore, 102 InterpolantComputations, 96 PerfectInterpolantSequences, 121/142 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-11_21-40-00-551.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-11_21-40-00-551.csv Completed graceful shutdown