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/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-12 00:07:14,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 00:07:14,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 00:07:14,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 00:07:14,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 00:07:14,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 00:07:14,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 00:07:14,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 00:07:14,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 00:07:14,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 00:07:14,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 00:07:14,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 00:07:14,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 00:07:14,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 00:07:14,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 00:07:14,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 00:07:14,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 00:07:14,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 00:07:14,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 00:07:14,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 00:07:14,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 00:07:14,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 00:07:14,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 00:07:14,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 00:07:14,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 00:07:14,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 00:07:14,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 00:07:14,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 00:07:14,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 00:07:14,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 00:07:14,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 00:07:14,300 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-12 00:07:14,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 00:07:14,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 00:07:14,323 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-12 00:07:14,323 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-12 00:07:14,324 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-12 00:07:14,324 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-12 00:07:14,324 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-12 00:07:14,324 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-12 00:07:14,325 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-12 00:07:14,325 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-12 00:07:14,325 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-12 00:07:14,325 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-12 00:07:14,325 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 00:07:14,326 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 00:07:14,326 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 00:07:14,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 00:07:14,326 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 00:07:14,326 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 00:07:14,326 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 00:07:14,326 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-12 00:07:14,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 00:07:14,327 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 00:07:14,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 00:07:14,327 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-12 00:07:14,327 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-12 00:07:14,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 00:07:14,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 00:07:14,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 00:07:14,328 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 00:07:14,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 00:07:14,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-12 00:07:14,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-12 00:07:14,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-12 00:07:14,329 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-12 00:07:14,330 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-12 00:07:14,330 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-12 00:07:14,330 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-12 00:07:14,330 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-12 00:07:14,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 00:07:14,372 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 00:07:14,375 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 00:07:14,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 00:07:14,376 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 00:07:14,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,688 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfce13fc85 [2018-04-12 00:07:14,871 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 00:07:14,871 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 00:07:14,872 INFO L168 CDTParser]: Scanning sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,883 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 00:07:14,884 INFO L215 ultiparseSymbolTable]: [2018-04-12 00:07:14,884 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 00:07:14,884 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,884 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 00:07:14,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__register_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ushort in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uint in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ulong in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__size_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_set in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__div_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__SLL in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:14,914 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfce13fc85 [2018-04-12 00:07:14,919 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 00:07:14,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 00:07:14,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 00:07:14,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 00:07:14,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 00:07:14,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 12:07:14" (1/1) ... [2018-04-12 00:07:14,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144da76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:14, skipping insertion in model container [2018-04-12 00:07:14,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 12:07:14" (1/1) ... [2018-04-12 00:07:14,949 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 00:07:14,983 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 00:07:15,177 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 00:07:15,232 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 00:07:15,240 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 00:07:15,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15 WrapperNode [2018-04-12 00:07:15,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 00:07:15,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 00:07:15,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 00:07:15,288 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 00:07:15,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (1/1) ... [2018-04-12 00:07:15,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (1/1) ... [2018-04-12 00:07:15,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (1/1) ... [2018-04-12 00:07:15,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (1/1) ... [2018-04-12 00:07:15,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (1/1) ... [2018-04-12 00:07:15,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (1/1) ... [2018-04-12 00:07:15,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (1/1) ... [2018-04-12 00:07:15,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 00:07:15,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 00:07:15,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 00:07:15,351 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 00:07:15,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (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-12 00:07:15,483 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 00:07:15,484 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 00:07:15,484 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 00:07:15,484 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 00:07:15,484 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 00:07:15,484 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 00:07:15,484 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 00:07:15,484 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 00:07:15,485 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 00:07:15,485 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 00:07:15,485 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 00:07:15,485 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 00:07:15,485 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 00:07:15,485 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 00:07:15,486 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 00:07:15,486 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 00:07:15,486 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 00:07:15,486 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 00:07:15,486 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 00:07:15,486 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 00:07:15,487 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 00:07:15,487 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 00:07:15,487 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 00:07:15,487 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 00:07:15,487 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 00:07:15,487 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 00:07:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 00:07:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 00:07:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 00:07:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 00:07:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 00:07:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 00:07:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 00:07:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 00:07:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 00:07:15,491 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 00:07:15,492 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 00:07:15,493 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 00:07:15,494 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 00:07:15,495 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 00:07:15,496 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 00:07:15,497 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 00:07:16,034 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 00:07:16,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 12:07:16 BoogieIcfgContainer [2018-04-12 00:07:16,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 00:07:16,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 00:07:16,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 00:07:16,038 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 00:07:16,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 12:07:14" (1/3) ... [2018-04-12 00:07:16,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ca6051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 12:07:16, skipping insertion in model container [2018-04-12 00:07:16,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:07:15" (2/3) ... [2018-04-12 00:07:16,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ca6051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 12:07:16, skipping insertion in model container [2018-04-12 00:07:16,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 12:07:16" (3/3) ... [2018-04-12 00:07:16,041 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:07:16,049 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 00:07:16,056 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-12 00:07:16,096 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 00:07:16,096 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 00:07:16,096 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-12 00:07:16,096 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 00:07:16,096 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 00:07:16,097 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 00:07:16,097 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 00:07:16,097 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 00:07:16,097 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 00:07:16,097 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 00:07:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2018-04-12 00:07:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-12 00:07:16,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:16,120 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:16,120 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -550235571, 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-12 00:07:16,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:16,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:16,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:16,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:16,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:16,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:07:16,257 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-12 00:07:16,257 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:16,268 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-12 00:07:16,291 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:16,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-12 00:07:16,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 00:07:16,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 00:07:16,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 00:07:16,305 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 4 states. [2018-04-12 00:07:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:16,592 INFO L93 Difference]: Finished difference Result 303 states and 336 transitions. [2018-04-12 00:07:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:07:16,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-12 00:07:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:16,614 INFO L225 Difference]: With dead ends: 303 [2018-04-12 00:07:16,614 INFO L226 Difference]: Without dead ends: 195 [2018-04-12 00:07:16,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-12 00:07:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-12 00:07:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-04-12 00:07:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-12 00:07:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2018-04-12 00:07:16,667 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 9 [2018-04-12 00:07:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:16,667 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2018-04-12 00:07:16,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 00:07:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2018-04-12 00:07:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-12 00:07:16,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:16,668 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:16,668 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash -550235570, 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-12 00:07:16,674 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:16,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:16,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 00:07:16,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:16,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:16,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:07:16,711 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-12 00:07:16,711 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:16,737 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-12 00:07:16,767 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:16,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-12 00:07:16,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:07:16,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:07:16,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:07:16,769 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand 6 states. [2018-04-12 00:07:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:17,057 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-04-12 00:07:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 00:07:17,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-12 00:07:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:17,060 INFO L225 Difference]: With dead ends: 171 [2018-04-12 00:07:17,060 INFO L226 Difference]: Without dead ends: 163 [2018-04-12 00:07:17,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 00:07:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-12 00:07:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2018-04-12 00:07:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-12 00:07:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2018-04-12 00:07:17,074 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 9 [2018-04-12 00:07:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:17,074 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2018-04-12 00:07:17,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:07:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2018-04-12 00:07:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 00:07:17,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:17,075 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:17,076 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash -646325675, 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-12 00:07:17,091 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:17,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:17,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 00:07:17,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:07:17,138 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-12 00:07:17,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:17,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,145 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-12 00:07:17,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-12 00:07:17,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-12 00:07:17,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-12 00:07:17,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,160 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-12 00:07:17,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-12 00:07:17,168 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-12 00:07:17,168 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:17,176 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-12 00:07:17,197 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:17,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-12 00:07:17,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:07:17,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:07:17,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:07:17,198 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand 5 states. [2018-04-12 00:07:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:17,612 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2018-04-12 00:07:17,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 00:07:17,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-12 00:07:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:17,614 INFO L225 Difference]: With dead ends: 340 [2018-04-12 00:07:17,614 INFO L226 Difference]: Without dead ends: 339 [2018-04-12 00:07:17,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 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-12 00:07:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-12 00:07:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 156. [2018-04-12 00:07:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-12 00:07:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2018-04-12 00:07:17,626 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 17 [2018-04-12 00:07:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:17,627 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2018-04-12 00:07:17,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:07:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2018-04-12 00:07:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 00:07:17,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:17,628 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:17,628 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash -646325674, 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-12 00:07:17,635 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:17,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:17,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:17,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:07:17,672 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-12 00:07:17,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:17,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,685 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-12 00:07:17,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:17,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,697 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-12 00:07:17,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-12 00:07:17,713 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-12 00:07:17,716 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-12 00:07:17,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,724 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-12 00:07:17,727 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-12 00:07:17,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,734 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-12 00:07:17,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-12 00:07:17,741 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-12 00:07:17,741 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:17,792 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:17,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-12 00:07:17,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:07:17,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:07:17,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:07:17,793 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 8 states. [2018-04-12 00:07:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:18,097 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2018-04-12 00:07:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:07:18,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-04-12 00:07:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:18,099 INFO L225 Difference]: With dead ends: 284 [2018-04-12 00:07:18,099 INFO L226 Difference]: Without dead ends: 283 [2018-04-12 00:07:18,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 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-12 00:07:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-12 00:07:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 155. [2018-04-12 00:07:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-12 00:07:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2018-04-12 00:07:18,112 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 17 [2018-04-12 00:07:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:18,112 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2018-04-12 00:07:18,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:07:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2018-04-12 00:07:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 00:07:18,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:18,113 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] [2018-04-12 00:07:18,114 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash 955719731, 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-12 00:07:18,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:18,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:18,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:18,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:18,147 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-12 00:07:18,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:18,152 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-12 00:07:18,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 00:07:18,165 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-12 00:07:18,165 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:18,215 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-12 00:07:18,247 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:18,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-12 00:07:18,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 00:07:18,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 00:07:18,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-12 00:07:18,248 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 7 states. [2018-04-12 00:07:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:18,515 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-04-12 00:07:18,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:07:18,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-12 00:07:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:18,516 INFO L225 Difference]: With dead ends: 231 [2018-04-12 00:07:18,516 INFO L226 Difference]: Without dead ends: 215 [2018-04-12 00:07:18,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-04-12 00:07:18,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-12 00:07:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 153. [2018-04-12 00:07:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-12 00:07:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-04-12 00:07:18,528 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 24 [2018-04-12 00:07:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:18,528 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-04-12 00:07:18,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 00:07:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2018-04-12 00:07:18,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 00:07:18,529 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:18,529 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] [2018-04-12 00:07:18,529 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:18,530 INFO L82 PathProgramCache]: Analyzing trace with hash 955719732, 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-12 00:07:18,536 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:18,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:18,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:18,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:18,578 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-12 00:07:18,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:18,585 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-12 00:07:18,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:18,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 1 xjuncts. [2018-04-12 00:07:18,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 00:07:18,600 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-12 00:07:18,600 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:18,673 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-12 00:07:18,694 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:18,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-12 00:07:18,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:07:18,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:07:18,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:07:18,695 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand 8 states. [2018-04-12 00:07:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:18,976 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2018-04-12 00:07:18,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:07:18,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-04-12 00:07:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:18,978 INFO L225 Difference]: With dead ends: 211 [2018-04-12 00:07:18,978 INFO L226 Difference]: Without dead ends: 207 [2018-04-12 00:07:18,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:07:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-12 00:07:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 175. [2018-04-12 00:07:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-12 00:07:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-04-12 00:07:18,987 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 24 [2018-04-12 00:07:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:18,987 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-04-12 00:07:18,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:07:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-04-12 00:07:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 00:07:18,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:18,988 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:18,988 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2110353715, 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-12 00:07:18,995 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:19,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:19,037 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-12 00:07:19,037 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:19,058 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-12 00:07:19,077 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:19,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 7 [2018-04-12 00:07:19,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:07:19,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:07:19,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:07:19,079 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 8 states. [2018-04-12 00:07:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:19,311 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2018-04-12 00:07:19,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 00:07:19,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-04-12 00:07:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:19,313 INFO L225 Difference]: With dead ends: 228 [2018-04-12 00:07:19,313 INFO L226 Difference]: Without dead ends: 221 [2018-04-12 00:07:19,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-04-12 00:07:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-12 00:07:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 185. [2018-04-12 00:07:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-12 00:07:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2018-04-12 00:07:19,321 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 27 [2018-04-12 00:07:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:19,321 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2018-04-12 00:07:19,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:07:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2018-04-12 00:07:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 00:07:19,322 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:19,322 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] [2018-04-12 00:07:19,323 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1421333449, 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-12 00:07:19,339 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:19,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:19,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:19,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:07:19,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 00:07:19,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 00:07:19,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,398 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-12 00:07:19,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-12 00:07:19,408 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-12 00:07:19,411 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-12 00:07:19,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,414 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-12 00:07:19,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-12 00:07:19,427 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-12 00:07:19,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:19,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-12 00:07:19,473 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:19,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-12 00:07:19,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:07:19,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:07:19,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:07:19,474 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand 6 states. [2018-04-12 00:07:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:19,681 INFO L93 Difference]: Finished difference Result 282 states and 315 transitions. [2018-04-12 00:07:19,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 00:07:19,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-12 00:07:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:19,682 INFO L225 Difference]: With dead ends: 282 [2018-04-12 00:07:19,682 INFO L226 Difference]: Without dead ends: 281 [2018-04-12 00:07:19,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:07:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-12 00:07:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 184. [2018-04-12 00:07:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-12 00:07:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2018-04-12 00:07:19,696 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 28 [2018-04-12 00:07:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:19,696 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2018-04-12 00:07:19,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:07:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2018-04-12 00:07:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 00:07:19,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:19,698 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] [2018-04-12 00:07:19,698 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1421333448, 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-12 00:07:19,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:19,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:19,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:19,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:07:19,750 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-12 00:07:19,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:19,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,775 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-12 00:07:19,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:19,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,788 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-12 00:07:19,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 00:07:19,797 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-12 00:07:19,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 13 treesize of output 5 [2018-04-12 00:07:19,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,805 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-12 00:07:19,806 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-12 00:07:19,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:19,810 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-12 00:07:19,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-12 00:07:19,821 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-12 00:07:19,821 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:19,861 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-12 00:07:19,881 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:19,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-12 00:07:19,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 00:07:19,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 00:07:19,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:07:19,882 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand 10 states. [2018-04-12 00:07:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:20,201 INFO L93 Difference]: Finished difference Result 310 states and 348 transitions. [2018-04-12 00:07:20,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 00:07:20,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-04-12 00:07:20,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:20,202 INFO L225 Difference]: With dead ends: 310 [2018-04-12 00:07:20,202 INFO L226 Difference]: Without dead ends: 302 [2018-04-12 00:07:20,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-04-12 00:07:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-12 00:07:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 176. [2018-04-12 00:07:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 00:07:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-04-12 00:07:20,215 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 28 [2018-04-12 00:07:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:20,215 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-04-12 00:07:20,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 00:07:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-04-12 00:07:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 00:07:20,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:20,217 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:20,217 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash -165448528, 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-12 00:07:20,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:20,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:20,261 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-12 00:07:20,261 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:20,276 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-12 00:07:20,307 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:20,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-12 00:07:20,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:07:20,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:07:20,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:07:20,308 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 5 states. [2018-04-12 00:07:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:20,420 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2018-04-12 00:07:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:07:20,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-12 00:07:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:20,422 INFO L225 Difference]: With dead ends: 250 [2018-04-12 00:07:20,422 INFO L226 Difference]: Without dead ends: 200 [2018-04-12 00:07:20,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 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-12 00:07:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-12 00:07:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2018-04-12 00:07:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 00:07:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 195 transitions. [2018-04-12 00:07:20,434 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 195 transitions. Word has length 30 [2018-04-12 00:07:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:20,434 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 195 transitions. [2018-04-12 00:07:20,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:07:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 195 transitions. [2018-04-12 00:07:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 00:07:20,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:20,436 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] [2018-04-12 00:07:20,436 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash -60387487, 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-12 00:07:20,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:20,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:20,520 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-12 00:07:20,520 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:20,543 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-12 00:07:20,564 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:20,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-12 00:07:20,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 00:07:20,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 00:07:20,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 00:07:20,565 INFO L87 Difference]: Start difference. First operand 176 states and 195 transitions. Second operand 4 states. [2018-04-12 00:07:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:20,595 INFO L93 Difference]: Finished difference Result 320 states and 357 transitions. [2018-04-12 00:07:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:07:20,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-12 00:07:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:20,597 INFO L225 Difference]: With dead ends: 320 [2018-04-12 00:07:20,597 INFO L226 Difference]: Without dead ends: 214 [2018-04-12 00:07:20,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-12 00:07:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-12 00:07:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2018-04-12 00:07:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-12 00:07:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-04-12 00:07:20,614 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 33 [2018-04-12 00:07:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:20,614 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-04-12 00:07:20,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 00:07:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-04-12 00:07:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-12 00:07:20,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:20,615 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-12 00:07:20,616 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 860124670, 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-12 00:07:20,628 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:20,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 00:07:20,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:20,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:20,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:20,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:20,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-12 00:07:20,792 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-12 00:07:20,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, 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-12 00:07:20,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:20,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:20,808 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-12 00:07:20,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-04-12 00:07:20,821 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-12 00:07:20,821 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:20,890 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:20,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2018-04-12 00:07:20,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 00:07:20,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 00:07:20,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:07:20,891 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 11 states. [2018-04-12 00:07:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:21,232 INFO L93 Difference]: Finished difference Result 347 states and 379 transitions. [2018-04-12 00:07:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 00:07:21,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-12 00:07:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:21,234 INFO L225 Difference]: With dead ends: 347 [2018-04-12 00:07:21,234 INFO L226 Difference]: Without dead ends: 346 [2018-04-12 00:07:21,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-04-12 00:07:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-12 00:07:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 198. [2018-04-12 00:07:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-12 00:07:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2018-04-12 00:07:21,254 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 35 [2018-04-12 00:07:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:21,255 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2018-04-12 00:07:21,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 00:07:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2018-04-12 00:07:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-12 00:07:21,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:21,256 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-12 00:07:21,256 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash 860124671, 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-12 00:07:21,262 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:21,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:21,286 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-12 00:07:21,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:21,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-12 00:07:21,303 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-12 00:07:21,305 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-12 00:07:21,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,307 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-12 00:07:21,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-12 00:07:21,315 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-12 00:07:21,316 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:21,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-12 00:07:21,356 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:21,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 11 [2018-04-12 00:07:21,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 00:07:21,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 00:07:21,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:07:21,357 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand 11 states. [2018-04-12 00:07:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:21,797 INFO L93 Difference]: Finished difference Result 601 states and 664 transitions. [2018-04-12 00:07:21,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 00:07:21,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-12 00:07:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:21,800 INFO L225 Difference]: With dead ends: 601 [2018-04-12 00:07:21,800 INFO L226 Difference]: Without dead ends: 483 [2018-04-12 00:07:21,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2018-04-12 00:07:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-12 00:07:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 210. [2018-04-12 00:07:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-12 00:07:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 232 transitions. [2018-04-12 00:07:21,819 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 232 transitions. Word has length 35 [2018-04-12 00:07:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:21,819 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 232 transitions. [2018-04-12 00:07:21,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 00:07:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 232 transitions. [2018-04-12 00:07:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 00:07:21,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:21,820 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-12 00:07:21,820 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:21,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1935314881, 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-12 00:07:21,831 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:21,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:21,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:21,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:21,914 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-12 00:07:21,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 00:07:21,949 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-12 00:07:21,953 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-12 00:07:21,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,963 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-12 00:07:21,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 00:07:21,991 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-12 00:07:21,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:21,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,005 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-12 00:07:22,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 00:07:22,054 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-12 00:07:22,056 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-12 00:07:22,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,062 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-12 00:07:22,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:22,071 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:15 [2018-04-12 00:07:22,090 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-12 00:07:22,090 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:22,208 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-12 00:07:22,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 11 treesize of output 10 [2018-04-12 00:07:22,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,260 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-12 00:07:22,263 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-12 00:07:22,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,278 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-12 00:07:22,281 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-12 00:07:22,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,305 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-12 00:07:22,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:22,320 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-04-12 00:07:22,368 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,368 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:25, output treesize:1 [2018-04-12 00:07:22,377 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-12 00:07:22,397 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:22,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2018-04-12 00:07:22,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 00:07:22,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 00:07:22,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-04-12 00:07:22,399 INFO L87 Difference]: Start difference. First operand 210 states and 232 transitions. Second operand 18 states. [2018-04-12 00:07:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:23,913 INFO L93 Difference]: Finished difference Result 619 states and 677 transitions. [2018-04-12 00:07:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 00:07:23,913 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-12 00:07:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:23,915 INFO L225 Difference]: With dead ends: 619 [2018-04-12 00:07:23,915 INFO L226 Difference]: Without dead ends: 618 [2018-04-12 00:07:23,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=457, Invalid=1349, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 00:07:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-04-12 00:07:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 227. [2018-04-12 00:07:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-12 00:07:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 253 transitions. [2018-04-12 00:07:23,946 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 253 transitions. Word has length 36 [2018-04-12 00:07:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:23,946 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 253 transitions. [2018-04-12 00:07:23,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 00:07:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 253 transitions. [2018-04-12 00:07:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 00:07:23,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:23,947 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-12 00:07:23,947 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1935314880, 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-12 00:07:23,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:23,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:24,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:24,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:24,147 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-12 00:07:24,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,180 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-12 00:07:24,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-12 00:07:24,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:07:24,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:24,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 00:07:24,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, 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-12 00:07:24,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,416 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-12 00:07:24,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-12 00:07:24,553 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-12 00:07:24,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:24,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,576 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-12 00:07:24,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:24,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,598 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-12 00:07:24,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-04-12 00:07:24,773 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-12 00:07:24,775 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-12 00:07:24,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,827 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-12 00:07:24,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,878 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-12 00:07:24,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 11 treesize of output 3 [2018-04-12 00:07:24,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,914 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-12 00:07:24,914 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,927 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,952 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-12 00:07:24,952 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:9 [2018-04-12 00:07:24,967 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-12 00:07:24,968 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:25,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-04-12 00:07:25,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:25,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,194 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-12 00:07:25,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-04-12 00:07:25,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,203 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-12 00:07:25,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-12 00:07:25,207 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,226 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-12 00:07:25,260 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-12 00:07:25,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:25,285 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,292 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-12 00:07:25,294 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-12 00:07:25,295 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,296 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,299 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-12 00:07:25,302 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-12 00:07:25,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:25,318 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,323 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-12 00:07:25,326 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-12 00:07:25,326 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,328 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,331 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-12 00:07:25,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-12 00:07:25,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:25,350 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,357 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-12 00:07:25,358 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-12 00:07:25,359 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,360 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,364 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-12 00:07:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-04-12 00:07:25,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, 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-12 00:07:25,402 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,409 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-12 00:07:25,411 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 3 [2018-04-12 00:07:25,411 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,412 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,417 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-12 00:07:25,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-12 00:07:25,437 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 5 variables, input treesize:113, output treesize:39 [2018-04-12 00:07:25,483 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-12 00:07:25,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-04-12 00:07:25,510 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-12 00:07:25,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-04-12 00:07:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:25,553 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:25,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2018-04-12 00:07:25,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 00:07:25,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 00:07:25,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-04-12 00:07:25,554 INFO L87 Difference]: Start difference. First operand 227 states and 253 transitions. Second operand 18 states. [2018-04-12 00:07:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:26,638 INFO L93 Difference]: Finished difference Result 602 states and 658 transitions. [2018-04-12 00:07:26,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 00:07:26,638 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-12 00:07:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:26,640 INFO L225 Difference]: With dead ends: 602 [2018-04-12 00:07:26,640 INFO L226 Difference]: Without dead ends: 601 [2018-04-12 00:07:26,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 00:07:26,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-04-12 00:07:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 227. [2018-04-12 00:07:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-12 00:07:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 252 transitions. [2018-04-12 00:07:26,664 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 252 transitions. Word has length 36 [2018-04-12 00:07:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:26,665 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 252 transitions. [2018-04-12 00:07:26,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 00:07:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 252 transitions. [2018-04-12 00:07:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 00:07:26,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:26,666 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-12 00:07:26,666 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:26,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1113365695, 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-12 00:07:26,672 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:26,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:26,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:26,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:07:26,698 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-12 00:07:26,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:26,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,707 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-12 00:07:26,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-04-12 00:07:26,711 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-12 00:07:26,713 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-12 00:07:26,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,715 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-12 00:07:26,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-04-12 00:07:26,719 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-12 00:07:26,719 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:26,723 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-12 00:07:26,742 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:26,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-12 00:07:26,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:07:26,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:07:26,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:07:26,743 INFO L87 Difference]: Start difference. First operand 227 states and 252 transitions. Second operand 5 states. [2018-04-12 00:07:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:26,918 INFO L93 Difference]: Finished difference Result 368 states and 408 transitions. [2018-04-12 00:07:26,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 00:07:26,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-12 00:07:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:26,920 INFO L225 Difference]: With dead ends: 368 [2018-04-12 00:07:26,920 INFO L226 Difference]: Without dead ends: 367 [2018-04-12 00:07:26,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 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-12 00:07:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-12 00:07:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 226. [2018-04-12 00:07:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-12 00:07:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 251 transitions. [2018-04-12 00:07:26,941 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 251 transitions. Word has length 36 [2018-04-12 00:07:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:26,942 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 251 transitions. [2018-04-12 00:07:26,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:07:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 251 transitions. [2018-04-12 00:07:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 00:07:26,942 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:26,943 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-12 00:07:26,943 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1113365696, 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-12 00:07:26,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:26,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:26,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:26,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:07:27,010 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-12 00:07:27,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 10 treesize of output 9 [2018-04-12 00:07:27,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,035 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-12 00:07:27,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:27,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,042 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-12 00:07:27,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-12 00:07:27,051 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-12 00:07:27,053 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-12 00:07:27,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,059 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-12 00:07:27,061 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-12 00:07:27,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,069 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-12 00:07:27,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-04-12 00:07:27,075 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-12 00:07:27,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:27,108 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-12 00:07:27,132 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:27,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-12 00:07:27,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:07:27,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:07:27,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:07:27,133 INFO L87 Difference]: Start difference. First operand 226 states and 251 transitions. Second operand 8 states. [2018-04-12 00:07:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:27,379 INFO L93 Difference]: Finished difference Result 372 states and 414 transitions. [2018-04-12 00:07:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:07:27,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-12 00:07:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:27,380 INFO L225 Difference]: With dead ends: 372 [2018-04-12 00:07:27,380 INFO L226 Difference]: Without dead ends: 371 [2018-04-12 00:07:27,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 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-12 00:07:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-12 00:07:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 225. [2018-04-12 00:07:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-12 00:07:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2018-04-12 00:07:27,394 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 36 [2018-04-12 00:07:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:27,394 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2018-04-12 00:07:27,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:07:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2018-04-12 00:07:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 00:07:27,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:27,395 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] [2018-04-12 00:07:27,395 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash 753877800, 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-12 00:07:27,408 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:27,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:27,445 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-12 00:07:27,446 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:27,474 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:07:27,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-12 00:07:27,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 00:07:27,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 00:07:27,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 00:07:27,475 INFO L87 Difference]: Start difference. First operand 225 states and 250 transitions. Second operand 4 states. [2018-04-12 00:07:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:27,494 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2018-04-12 00:07:27,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:07:27,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-12 00:07:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:27,495 INFO L225 Difference]: With dead ends: 347 [2018-04-12 00:07:27,495 INFO L226 Difference]: Without dead ends: 246 [2018-04-12 00:07:27,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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-12 00:07:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-12 00:07:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 229. [2018-04-12 00:07:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-12 00:07:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2018-04-12 00:07:27,515 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 50 [2018-04-12 00:07:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:27,516 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2018-04-12 00:07:27,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 00:07:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2018-04-12 00:07:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 00:07:27,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:27,517 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] [2018-04-12 00:07:27,517 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:27,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1430642435, 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-12 00:07:27,526 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:27,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:27,584 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-12 00:07:27,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:27,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,602 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-12 00:07:27,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:27,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-12 00:07:27,635 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-12 00:07:27,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:27,638 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-12 00:07:27,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,652 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-12 00:07:27,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:27,656 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-12 00:07:27,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-12 00:07:27,693 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 16 [2018-04-12 00:07:27,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-12 00:07:27,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,703 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 16 [2018-04-12 00:07:27,704 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 16 treesize of output 3 [2018-04-12 00:07:27,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:27,708 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-12 00:07:27,708 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-04-12 00:07:27,734 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-12 00:07:27,735 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:27,777 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-12 00:07:27,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:07:27,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2018-04-12 00:07:27,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 00:07:27,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 00:07:27,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:07:27,798 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand 11 states. [2018-04-12 00:07:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:28,204 INFO L93 Difference]: Finished difference Result 443 states and 483 transitions. [2018-04-12 00:07:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 00:07:28,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-04-12 00:07:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:28,205 INFO L225 Difference]: With dead ends: 443 [2018-04-12 00:07:28,205 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 00:07:28,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2018-04-12 00:07:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 00:07:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 264. [2018-04-12 00:07:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-12 00:07:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 291 transitions. [2018-04-12 00:07:28,221 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 291 transitions. Word has length 52 [2018-04-12 00:07:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:28,222 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 291 transitions. [2018-04-12 00:07:28,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 00:07:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 291 transitions. [2018-04-12 00:07:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 00:07:28,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:28,222 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:28,222 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1631727874, 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-12 00:07:28,237 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:28,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:28,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,281 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-12 00:07:28,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 00:07:28,385 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-12 00:07:28,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, 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-12 00:07:28,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,414 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-12 00:07:28,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 00:07:28,480 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-12 00:07:28,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:28,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,508 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-12 00:07:28,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 00:07:28,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-12 00:07:28,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,602 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-12 00:07:28,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-12 00:07:28,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-12 00:07:28,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-04-12 00:07:28,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:28,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-12 00:07:28,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 98 [2018-04-12 00:07:28,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:28,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,858 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-12 00:07:28,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:80 [2018-04-12 00:07:28,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 95 [2018-04-12 00:07:28,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:28,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-12 00:07:28,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,946 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-12 00:07:28,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:102 [2018-04-12 00:07:29,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 64 [2018-04-12 00:07:29,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:29,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-04-12 00:07:29,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,087 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-12 00:07:29,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-04-12 00:07:29,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:29,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:29,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:29,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:28 [2018-04-12 00:07:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:29,146 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 87 [2018-04-12 00:07:29,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 11 treesize of output 10 [2018-04-12 00:07:29,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,593 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 86 treesize of output 80 [2018-04-12 00:07:29,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 66 treesize of output 65 [2018-04-12 00:07:29,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:29,635 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,635 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 65 treesize of output 67 [2018-04-12 00:07:29,636 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,672 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 62 treesize of output 56 [2018-04-12 00:07:29,690 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,691 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 33 [2018-04-12 00:07:29,692 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,708 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,709 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 41 treesize of output 36 [2018-04-12 00:07:29,711 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-12 00:07:29,711 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,718 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,719 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,719 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 27 treesize of output 17 [2018-04-12 00:07:29,719 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,733 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,760 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-04-12 00:07:29,793 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,793 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-04-12 00:07:29,794 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-04-12 00:07:29,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,810 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:29,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-12 00:07:29,810 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,814 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,819 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-12 00:07:29,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:29,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:29,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:07:29,842 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:168, output treesize:47 [2018-04-12 00:07:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:29,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:07:29,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-04-12 00:07:29,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 00:07:29,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 00:07:29,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=800, Unknown=1, NotChecked=0, Total=992 [2018-04-12 00:07:29,963 INFO L87 Difference]: Start difference. First operand 264 states and 291 transitions. Second operand 32 states. [2018-04-12 00:07:33,110 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 81 DAG size of output 63 [2018-04-12 00:07:33,326 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 79 DAG size of output 77 [2018-04-12 00:07:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:36,355 INFO L93 Difference]: Finished difference Result 866 states and 930 transitions. [2018-04-12 00:07:36,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-12 00:07:36,355 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2018-04-12 00:07:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:36,358 INFO L225 Difference]: With dead ends: 866 [2018-04-12 00:07:36,358 INFO L226 Difference]: Without dead ends: 865 [2018-04-12 00:07:36,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1979, Invalid=7140, Unknown=1, NotChecked=0, Total=9120 [2018-04-12 00:07:36,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-12 00:07:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 299. [2018-04-12 00:07:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-12 00:07:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2018-04-12 00:07:36,397 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 54 [2018-04-12 00:07:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:36,397 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2018-04-12 00:07:36,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 00:07:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2018-04-12 00:07:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 00:07:36,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:36,398 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:07:36,398 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 00:07:36,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1631727873, 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-12 00:07:36,410 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:36,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:36,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 00:07:36,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,470 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-12 00:07:36,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-12 00:07:36,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 00:07:36,499 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-12 00:07:36,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,515 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-12 00:07:36,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:36,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,528 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-12 00:07:36,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-12 00:07:36,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-04-12 00:07:36,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:36,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-12 00:07:36,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 14 treesize of output 13 [2018-04-12 00:07:36,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,621 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-12 00:07:36,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-12 00:07:36,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-12 00:07:36,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-12 00:07:36,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,755 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-12 00:07:36,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-12 00:07:36,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 42 [2018-04-12 00:07:36,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,798 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-12 00:07:36,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-04-12 00:07:36,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-04-12 00:07:36,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,882 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-12 00:07:36,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:97 [2018-04-12 00:07:36,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 59 [2018-04-12 00:07:36,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:36,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:37,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 122 [2018-04-12 00:07:37,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:37,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,086 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-12 00:07:37,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:120, output treesize:108 [2018-04-12 00:07:37,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 55 treesize of output 74 [2018-04-12 00:07:37,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:37,202 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 20 treesize of output 31 [2018-04-12 00:07:37,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2018-04-12 00:07:37,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:37,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-12 00:07:37,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,293 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-12 00:07:37,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:159, output treesize:143 [2018-04-12 00:07:37,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 93 [2018-04-12 00:07:37,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:37,478 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 15 treesize of output 6 [2018-04-12 00:07:37,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 00:07:37,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-04-12 00:07:37,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:37,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:37,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2018-04-12 00:07:37,533 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-12 00:07:37,533 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:37,542 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 13 treesize of output 6 [2018-04-12 00:07:37,542 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,547 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-12 00:07:37,547 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,548 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:37,554 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-12 00:07:37,555 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:142, output treesize:18 [2018-04-12 00:07:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:37,601 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 248 [2018-04-12 00:07:42,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:42,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:42,761 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 235 treesize of output 229 [2018-04-12 00:07:42,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 214 [2018-04-12 00:07:42,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:42,820 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 214 treesize of output 222 [2018-04-12 00:07:42,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:42,883 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 202 [2018-04-12 00:07:42,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:42,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:42,911 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 29 [2018-04-12 00:07:42,911 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:42,933 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 182 treesize of output 176 [2018-04-12 00:07:42,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:42,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:42,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 172 [2018-04-12 00:07:42,937 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:42,943 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:42,950 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:42,955 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 204 [2018-04-12 00:07:42,983 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:42,985 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:42,991 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 3 case distinctions, treesize of input 24 treesize of output 46 [2018-04-12 00:07:42,992 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:43,022 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 186 treesize of output 180 [2018-04-12 00:07:43,024 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,025 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,025 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 176 treesize of output 166 [2018-04-12 00:07:43,025 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,033 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,035 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 190 treesize of output 182 [2018-04-12 00:07:43,040 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,042 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 184 [2018-04-12 00:07:43,052 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-04-12 00:07:43,087 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:43,110 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:43,189 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 214 treesize of output 220 [2018-04-12 00:07:43,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 367 treesize of output 395 [2018-04-12 00:07:43,311 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:43,313 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-12 00:07:43,313 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,318 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 227 [2018-04-12 00:07:43,341 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:43,460 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 193 treesize of output 221 [2018-04-12 00:07:43,474 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:43,568 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,579 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 3 case distinctions, treesize of input 191 treesize of output 213 [2018-04-12 00:07:43,579 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:43,698 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 194 treesize of output 186 [2018-04-12 00:07:43,702 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 184 [2018-04-12 00:07:43,716 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-04-12 00:07:43,766 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:43,768 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 190 treesize of output 184 [2018-04-12 00:07:43,770 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,770 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,771 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 176 treesize of output 166 [2018-04-12 00:07:43,771 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,779 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,889 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 196 treesize of output 196 [2018-04-12 00:07:43,892 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 191 treesize of output 185 [2018-04-12 00:07:43,893 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,918 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 188 treesize of output 171 [2018-04-12 00:07:43,919 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,943 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 185 treesize of output 172 [2018-04-12 00:07:43,944 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:43,965 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:43,974 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 206 treesize of output 202 [2018-04-12 00:07:43,979 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:43,995 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 2 case distinctions, treesize of input 182 treesize of output 181 [2018-04-12 00:07:43,995 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-04-12 00:07:44,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,048 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 197 treesize of output 184 [2018-04-12 00:07:44,049 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,096 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 179 treesize of output 171 [2018-04-12 00:07:44,097 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,138 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 00:07:44,208 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:44,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:44,299 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-12 00:07:44,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 94 [2018-04-12 00:07:44,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 11 treesize of output 10 [2018-04-12 00:07:44,355 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,381 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 81 treesize of output 75 [2018-04-12 00:07:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-04-12 00:07:44,386 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,413 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,414 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 75 [2018-04-12 00:07:44,415 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,459 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 60 treesize of output 66 [2018-04-12 00:07:44,509 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,509 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,510 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,518 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 2 case distinctions, treesize of input 54 treesize of output 81 [2018-04-12 00:07:44,519 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,529 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 2 case distinctions, treesize of input 40 treesize of output 67 [2018-04-12 00:07:44,529 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,531 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-12 00:07:44,531 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,610 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 76 [2018-04-12 00:07:44,619 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2018-04-12 00:07:44,689 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,690 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,690 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 25 treesize of output 15 [2018-04-12 00:07:44,690 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,702 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,708 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 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-12 00:07:44,708 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,724 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:44,767 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 36 treesize of output 36 [2018-04-12 00:07:44,770 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,770 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,771 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,775 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 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-12 00:07:44,776 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,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 31 treesize of output 25 [2018-04-12 00:07:44,799 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,816 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 25 treesize of output 12 [2018-04-12 00:07:44,816 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,828 INFO L267 ElimStorePlain]: Start of recursive call 48: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:44,849 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 32 treesize of output 26 [2018-04-12 00:07:44,851 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:44,852 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 22 treesize of output 9 [2018-04-12 00:07:44,852 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,855 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,865 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,889 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,898 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:44,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 111 [2018-04-12 00:07:44,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:44,957 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,976 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 88 treesize of output 63 [2018-04-12 00:07:44,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-12 00:07:44,981 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:44,990 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 54 treesize of output 45 [2018-04-12 00:07:45,008 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,009 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 22 [2018-04-12 00:07:45,010 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,022 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 35 treesize of output 33 [2018-04-12 00:07:45,024 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,026 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 29 treesize of output 20 [2018-04-12 00:07:45,026 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,030 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,033 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,035 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,041 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,045 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 173 treesize of output 104 [2018-04-12 00:07:45,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:45,047 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,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 88 treesize of output 68 [2018-04-12 00:07:45,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 00:07:45,063 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,074 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 64 treesize of output 58 [2018-04-12 00:07:45,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,093 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 24 [2018-04-12 00:07:45,093 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,107 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 43 treesize of output 38 [2018-04-12 00:07:45,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, 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-12 00:07:45,109 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,116 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,117 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 29 treesize of output 16 [2018-04-12 00:07:45,117 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,120 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,121 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,122 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,127 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,132 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 175 treesize of output 106 [2018-04-12 00:07:45,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 11 treesize of output 10 [2018-04-12 00:07:45,135 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,169 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 88 treesize of output 82 [2018-04-12 00:07:45,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-04-12 00:07:45,173 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,211 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 67 treesize of output 73 [2018-04-12 00:07:45,212 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,243 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-04-12 00:07:45,261 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 42 [2018-04-12 00:07:45,270 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,294 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 35 [2018-04-12 00:07:45,298 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,308 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 1 case distinctions, treesize of input 35 treesize of output 29 [2018-04-12 00:07:45,308 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,324 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,326 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-12 00:07:45,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2018-04-12 00:07:45,329 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,333 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,349 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,389 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 67 treesize of output 73 [2018-04-12 00:07:45,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-04-12 00:07:45,449 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,450 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-12 00:07:45,450 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 80 [2018-04-12 00:07:45,456 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,543 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 2 case distinctions, treesize of input 44 treesize of output 62 [2018-04-12 00:07:45,543 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,603 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2018-04-12 00:07:45,614 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,687 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 47 treesize of output 47 [2018-04-12 00:07:45,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-04-12 00:07:45,693 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,710 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 42 treesize of output 33 [2018-04-12 00:07:45,710 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,723 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,725 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 28 treesize of output 23 [2018-04-12 00:07:45,725 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,734 INFO L267 ElimStorePlain]: Start of recursive call 88: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,740 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 51 treesize of output 49 [2018-04-12 00:07:45,746 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,753 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 1 case distinctions, treesize of input 35 treesize of output 29 [2018-04-12 00:07:45,753 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,780 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 44 treesize of output 35 [2018-04-12 00:07:45,780 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,796 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,802 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 1 case distinctions, treesize of input 30 treesize of output 32 [2018-04-12 00:07:45,802 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,820 INFO L267 ElimStorePlain]: Start of recursive call 92: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 00:07:45,858 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 35 treesize of output 29 [2018-04-12 00:07:45,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:45,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2018-04-12 00:07:45,862 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,866 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:45,875 INFO L267 ElimStorePlain]: Start of recursive call 82: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,888 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,895 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:45,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-04-12 00:07:45,933 INFO L202 ElimStorePlain]: Needed 97 recursive calls to eliminate 11 variables, input treesize:481, output treesize:126 [2018-04-12 00:07:46,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-04-12 00:07:46,043 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:46,044 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:46,044 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 12 treesize of output 10 [2018-04-12 00:07:46,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:46,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:46,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 00:07:46,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:101, output treesize:60 [2018-04-12 00:07:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:46,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:07:46,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2018-04-12 00:07:46,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 00:07:46,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 00:07:46,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=993, Unknown=3, NotChecked=0, Total=1122 [2018-04-12 00:07:46,217 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand 34 states. [2018-04-12 00:07:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:46,228 INFO L93 Difference]: Finished difference Result 299 states and 332 transitions. [2018-04-12 00:07:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-12 00:07:46,228 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-04-12 00:07:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:46,229 INFO L225 Difference]: With dead ends: 299 [2018-04-12 00:07:46,229 INFO L226 Difference]: Without dead ends: 0 [2018-04-12 00:07:46,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=126, Invalid=993, Unknown=3, NotChecked=0, Total=1122 [2018-04-12 00:07:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-12 00:07:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-12 00:07:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-12 00:07:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-12 00:07:46,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-04-12 00:07:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:46,231 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-12 00:07:46,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 00:07:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-12 00:07:46,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-12 00:07:46,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-04-12 00:07:46,274 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-04-12 00:07:46,274 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-04-12 00:07:46,274 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L412 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: false [2018-04-12 00:07:46,275 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point mainErr35RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point mainErr0RequiresViolation(line 986) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point L986'(line 986) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point mainErr9RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point mainErr51RequiresViolation(line 997) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point L994'''(lines 994 998) no Hoare annotation was computed. [2018-04-12 00:07:46,275 INFO L416 ceAbstractionStarter]: For program point L987''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point mainErr4RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point mainErr55RequiresViolation(line 1006) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point mainErr29RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point L996'''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point L987'''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point L987'(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point mainErr45RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point mainErr19RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,276 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L987''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point mainErr14RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L990'''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L990'''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L996'(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point mainErr21RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point mainErr39RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L987'''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point mainErr56RequiresViolation(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,277 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point mainErr30RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point mainErr41RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L419 ceAbstractionStarter]: At program point L1008''(lines 1002 1009) the Hoare annotation is: true [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point L996''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point mainErr25RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point mainErr10RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point mainErr61AssertViolationMEMORY_FREE(line 1008) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point mainErr36RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point L997'(line 997) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,278 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainErr11RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainErr24RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 982 1012) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point L987'''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainErr16RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainErr40RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainErr32RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point L1007'''(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L419 ceAbstractionStarter]: At program point L994''(lines 994 998) the Hoare annotation is: true [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainErr57RequiresViolation(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,279 INFO L416 ceAbstractionStarter]: For program point mainErr5RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point mainErr46RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point mainErr54RequiresViolation(line 1006) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point mainErr8RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point mainErr38RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point L1002(lines 1002 1009) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point L1004(line 1004) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point L1006'''''(lines 1006 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point mainErr62EnsuresViolationMEMORY_LEAK(lines 982 1012) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,280 INFO L416 ceAbstractionStarter]: For program point L1006(line 1006) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L1005(line 1005) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L1008(line 1008) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L1007(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L990''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point mainErr49RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L1002''(lines 1002 1009) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point mainErr27RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,281 INFO L416 ceAbstractionStarter]: For program point L986(line 986) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L985(line 985) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L1005'(line 1005) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point mainErr58AssertViolationMEMORY_FREE(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L987(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point mainErr2RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L990''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L419 ceAbstractionStarter]: At program point L990'''''''''''''''''''''''''''''''(line 990) the Hoare annotation is: true [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point mainErr43RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L416 ceAbstractionStarter]: For program point mainErr17RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,282 INFO L419 ceAbstractionStarter]: At program point L996''''''''''''''''''''''''''''''''''''''(line 996) the Hoare annotation is: true [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point L1005''(line 1005) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point mainErr37RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point L990'(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 982 1012) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point mainErr7RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point mainErr53RequiresViolation(line 1005) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point L990''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point mainErr22RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,283 INFO L416 ceAbstractionStarter]: For program point mainErr59AssertViolationMEMORY_FREE(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L996''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point mainErr6RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L987''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point mainErr48RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point mainErr47RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L996''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L987'''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point mainErr13RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,284 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point mainErr3RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L990(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L996'''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L997(line 997) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L996(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L994(lines 994 998) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point mainErr33RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point mainErr28RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L990'''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point L1006''''(line 1006) no Hoare annotation was computed. [2018-04-12 00:07:46,285 INFO L416 ceAbstractionStarter]: For program point mainErr1RequiresViolation(line 986) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr52RequiresViolation(line 1005) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr18RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr44RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point L990''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr34RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr26RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point L990'''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point L1007''(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr42RequiresViolation(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point L1008'(line 1008) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L419 ceAbstractionStarter]: At program point mainENTRY(lines 982 1012) the Hoare annotation is: true [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr50RequiresViolation(line 997) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point L996''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,286 INFO L416 ceAbstractionStarter]: For program point mainErr31RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L990''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L1007'(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L987''''''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L987''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point mainErr60AssertViolationMEMORY_FREE(line 1008) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L996''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L1006''(line 1006) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L1007''''(line 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L987'''''''''''(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L996''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point mainErr20RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point mainErr12RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L996'''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L1006'(lines 1006 1007) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point mainErr15RequiresViolation(line 987) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''''''''''''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,287 INFO L416 ceAbstractionStarter]: For program point L996'''''''''''''(line 996) no Hoare annotation was computed. [2018-04-12 00:07:46,288 INFO L416 ceAbstractionStarter]: For program point mainErr23RequiresViolation(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,288 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,288 INFO L416 ceAbstractionStarter]: For program point L990''''''''''''''''''''''''''''''''(line 990) no Hoare annotation was computed. [2018-04-12 00:07:46,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 12:07:46 BoogieIcfgContainer [2018-04-12 00:07:46,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 00:07:46,296 INFO L168 Benchmark]: Toolchain (without parser) took 31375.65 ms. Allocated memory was 306.2 MB in the beginning and 677.9 MB in the end (delta: 371.7 MB). Free memory was 243.8 MB in the beginning and 424.0 MB in the end (delta: -180.2 MB). Peak memory consumption was 191.5 MB. Max. memory is 5.3 GB. [2018-04-12 00:07:46,297 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 00:07:46,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.97 ms. Allocated memory is still 306.2 MB. Free memory was 243.8 MB in the beginning and 215.3 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 5.3 GB. [2018-04-12 00:07:46,297 INFO L168 Benchmark]: Boogie Preprocessor took 63.14 ms. Allocated memory is still 306.2 MB. Free memory was 215.3 MB in the beginning and 212.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-12 00:07:46,297 INFO L168 Benchmark]: RCFGBuilder took 683.86 ms. Allocated memory was 306.2 MB in the beginning and 470.3 MB in the end (delta: 164.1 MB). Free memory was 212.3 MB in the beginning and 386.1 MB in the end (delta: -173.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. [2018-04-12 00:07:46,298 INFO L168 Benchmark]: TraceAbstraction took 30259.29 ms. Allocated memory was 470.3 MB in the beginning and 677.9 MB in the end (delta: 207.6 MB). Free memory was 384.7 MB in the beginning and 424.0 MB in the end (delta: -39.2 MB). Peak memory consumption was 168.4 MB. Max. memory is 5.3 GB. [2018-04-12 00:07:46,299 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 363.97 ms. Allocated memory is still 306.2 MB. Free memory was 243.8 MB in the beginning and 215.3 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 63.14 ms. Allocated memory is still 306.2 MB. Free memory was 215.3 MB in the beginning and 212.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 683.86 ms. Allocated memory was 306.2 MB in the beginning and 470.3 MB in the end (delta: 164.1 MB). Free memory was 212.3 MB in the beginning and 386.1 MB in the end (delta: -173.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 30259.29 ms. Allocated memory was 470.3 MB in the beginning and 677.9 MB in the end (delta: 207.6 MB). Free memory was 384.7 MB in the beginning and 424.0 MB in the end (delta: -39.2 MB). Peak memory consumption was 168.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 997]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1006]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 986]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1006]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 982]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1008]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 997]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1007]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1005]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 986]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1008]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1005]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 990]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 987]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 996]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 63 specifications checked. All of them hold - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 184 locations, 63 error locations. SAFE Result, 30.2s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2993 SDtfs, 10608 SDslu, 11717 SDs, 0 SdLazy, 7707 SolverSat, 787 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1520 GetRequests, 1144 SyntacticMatches, 3 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4414 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=20, 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.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 2901 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 8 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1298 ConstructedInterpolants, 185 QuantifiedInterpolants, 936756 SizeOfPredicates, 176 NumberOfNonLiveVariables, 2308 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 42 InterpolantComputations, 36 PerfectInterpolantSequences, 12/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_00-07-46-309.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_00-07-46-309.csv Received shutdown request...