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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:18:16,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:18:16,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:18:16,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:18:16,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:18:16,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:18:16,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:18:16,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:18:16,376 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:18:16,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:18:16,378 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:18:16,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:18:16,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:18:16,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:18:16,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:18:16,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:18:16,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:18:16,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:18:16,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:18:16,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:18:16,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:18:16,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:18:16,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:18:16,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:18:16,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:18:16,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:18:16,392 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:18:16,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:18:16,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:18:16,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:18:16,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:18:16,394 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-10 14:18:16,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:18:16,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:18:16,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:18:16,461 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:18:16,461 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:18:16,461 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:18:16,462 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:18:16,462 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:18:16,462 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:18:16,462 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:18:16,462 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:18:16,462 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:18:16,462 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:18:16,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:18:16,463 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:18:16,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:18:16,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:18:16,463 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:18:16,463 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:18:16,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:18:16,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:18:16,464 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:18:16,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:18:16,464 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:18:16,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:18:16,500 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:18:16,503 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:18:16,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:18:16,505 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:18:16,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,829 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdc9a31968 [2018-04-10 14:18:16,960 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:18:16,960 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:18:16,961 INFO L168 CDTParser]: Scanning sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,969 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:18:16,970 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:18:16,970 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:18:16,970 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,970 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:18:16,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____dev_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_char in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____off64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__div_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____id_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_char in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__time_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__uid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____mode_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____ino_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____time_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____loff_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__size_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_long in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____clock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__mode_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ulong in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__SLL in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_short in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__gid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_short in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__clock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_long in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fd_set in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__uint in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__id_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__dev_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__register_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____key_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__off_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_int in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__loff_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ushort in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ino_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____gid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____pid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____timer_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__timer_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__key_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:16,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____off_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:17,012 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdc9a31968 [2018-04-10 14:18:17,015 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:18:17,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:18:17,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:18:17,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:18:17,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:18:17,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402d4be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17, skipping insertion in model container [2018-04-10 14:18:17,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,033 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:18:17,058 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:18:17,185 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:18:17,221 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:18:17,226 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:18:17,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17 WrapperNode [2018-04-10 14:18:17,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:18:17,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:18:17,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:18:17,259 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:18:17,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... [2018-04-10 14:18:17,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:18:17,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:18:17,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:18:17,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:18:17,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (1/1) ... No working directory specified, using /home/ultimate/work/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-10 14:18:17,382 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:18:17,382 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:18:17,382 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:18:17,382 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:18:17,383 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:18:17,384 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:18:17,385 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:18:17,386 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:18:17,387 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:18:17,388 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:18:17,724 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:18:17,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:18:17 BoogieIcfgContainer [2018-04-10 14:18:17,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:18:17,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:18:17,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:18:17,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:18:17,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:18:17" (1/3) ... [2018-04-10 14:18:17,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf9c1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:18:17, skipping insertion in model container [2018-04-10 14:18:17,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:18:17" (2/3) ... [2018-04-10 14:18:17,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf9c1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:18:17, skipping insertion in model container [2018-04-10 14:18:17,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:18:17" (3/3) ... [2018-04-10 14:18:17,730 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:18:17,735 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:18:17,743 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-04-10 14:18:17,774 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:18:17,774 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:18:17,774 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:18:17,775 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:18:17,775 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:18:17,775 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:18:17,775 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:18:17,775 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:18:17,775 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:18:17,776 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:18:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-04-10 14:18:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:18:17,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:17,801 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:17,801 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash -917461765, now seen corresponding path program 1 times [2018-04-10 14:18:17,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:17,805 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:17,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:17,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:17,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:17,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:17,913 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-10 14:18:17,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:17,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:18:17,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:18:17,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:18:17,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:18:17,931 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2018-04-10 14:18:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:18,050 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-04-10 14:18:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:18:18,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:18:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:18,058 INFO L225 Difference]: With dead ends: 122 [2018-04-10 14:18:18,059 INFO L226 Difference]: Without dead ends: 119 [2018-04-10 14:18:18,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10 14:18:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-10 14:18:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2018-04-10 14:18:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-10 14:18:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-04-10 14:18:18,088 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-04-10 14:18:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:18,089 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-04-10 14:18:18,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:18:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-04-10 14:18:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:18:18,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:18,089 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:18,089 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash -917461764, now seen corresponding path program 1 times [2018-04-10 14:18:18,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:18,090 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:18,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:18,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:18,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:18,142 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-10 14:18:18,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:18,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:18:18,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:18:18,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:18:18,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:18:18,145 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-04-10 14:18:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:18,223 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-04-10 14:18:18,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:18:18,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:18:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:18,225 INFO L225 Difference]: With dead ends: 109 [2018-04-10 14:18:18,225 INFO L226 Difference]: Without dead ends: 109 [2018-04-10 14:18:18,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10 14:18:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-10 14:18:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2018-04-10 14:18:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-10 14:18:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-04-10 14:18:18,232 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2018-04-10 14:18:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:18,232 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-04-10 14:18:18,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:18:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-04-10 14:18:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 14:18:18,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:18,233 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:18,233 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1063193416, now seen corresponding path program 1 times [2018-04-10 14:18:18,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:18,233 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:18,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:18,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:18,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:18,279 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-10 14:18:18,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:18,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:18:18,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:18:18,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:18:18,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:18:18,280 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2018-04-10 14:18:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:18,352 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-04-10 14:18:18,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:18:18,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-10 14:18:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:18,353 INFO L225 Difference]: With dead ends: 94 [2018-04-10 14:18:18,353 INFO L226 Difference]: Without dead ends: 94 [2018-04-10 14:18:18,354 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10 14:18:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-10 14:18:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2018-04-10 14:18:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-10 14:18:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-04-10 14:18:18,358 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 14 [2018-04-10 14:18:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:18,359 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-04-10 14:18:18,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:18:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-04-10 14:18:18,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 14:18:18,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:18,359 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:18,359 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1063193415, now seen corresponding path program 1 times [2018-04-10 14:18:18,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:18,360 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:18,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:18,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:18,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:18,413 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-10 14:18:18,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:18,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:18:18,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:18:18,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:18:18,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:18:18,414 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 5 states. [2018-04-10 14:18:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:18,513 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-04-10 14:18:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:18:18,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-10 14:18:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:18,514 INFO L225 Difference]: With dead ends: 107 [2018-04-10 14:18:18,514 INFO L226 Difference]: Without dead ends: 107 [2018-04-10 14:18:18,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10 14:18:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-10 14:18:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2018-04-10 14:18:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-10 14:18:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-04-10 14:18:18,519 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 14 [2018-04-10 14:18:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:18,519 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-04-10 14:18:18,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:18:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-04-10 14:18:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:18:18,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:18,520 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:18,520 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash -375165306, now seen corresponding path program 1 times [2018-04-10 14:18:18,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:18,521 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:18,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:18,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:18,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:18,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:18,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:18:18,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:18:18,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:18:18,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:18:18,610 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 6 states. [2018-04-10 14:18:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:18,809 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-10 14:18:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:18:18,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-10 14:18:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:18,810 INFO L225 Difference]: With dead ends: 140 [2018-04-10 14:18:18,810 INFO L226 Difference]: Without dead ends: 140 [2018-04-10 14:18:18,810 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:18:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-10 14:18:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 80. [2018-04-10 14:18:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-10 14:18:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-04-10 14:18:18,814 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 18 [2018-04-10 14:18:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:18,814 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-04-10 14:18:18,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:18:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-04-10 14:18:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:18:18,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:18,815 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:18,815 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash -375165307, now seen corresponding path program 1 times [2018-04-10 14:18:18,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:18,815 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:18,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:18,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:18,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:18,857 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-10 14:18:18,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:18,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:18:18,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:18:18,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:18:18,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:18:18,858 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 6 states. [2018-04-10 14:18:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:18,997 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-04-10 14:18:18,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:18:18,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-10 14:18:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:18,998 INFO L225 Difference]: With dead ends: 134 [2018-04-10 14:18:18,998 INFO L226 Difference]: Without dead ends: 134 [2018-04-10 14:18:18,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:18:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-10 14:18:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 79. [2018-04-10 14:18:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-10 14:18:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-10 14:18:19,002 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 18 [2018-04-10 14:18:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:19,002 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-10 14:18:19,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:18:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-10 14:18:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 14:18:19,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:19,003 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:19,003 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:19,003 INFO L82 PathProgramCache]: Analyzing trace with hash -648913822, now seen corresponding path program 1 times [2018-04-10 14:18:19,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:19,004 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:19,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:19,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:19,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:19,043 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-10 14:18:19,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:19,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:18:19,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:18:19,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:18:19,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:18:19,044 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 7 states. [2018-04-10 14:18:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:19,184 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-04-10 14:18:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:18:19,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-10 14:18:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:19,185 INFO L225 Difference]: With dead ends: 133 [2018-04-10 14:18:19,185 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 14:18:19,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:18:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 14:18:19,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 90. [2018-04-10 14:18:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-10 14:18:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2018-04-10 14:18:19,188 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 21 [2018-04-10 14:18:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:19,189 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-04-10 14:18:19,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:18:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-04-10 14:18:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 14:18:19,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:19,189 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:19,190 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:19,190 INFO L82 PathProgramCache]: Analyzing trace with hash -648913821, now seen corresponding path program 1 times [2018-04-10 14:18:19,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:19,190 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:19,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:19,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:19,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:19,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:19,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:18:19,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:18:19,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:18:19,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:18:19,258 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 7 states. [2018-04-10 14:18:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:19,397 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-04-10 14:18:19,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:18:19,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-10 14:18:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:19,398 INFO L225 Difference]: With dead ends: 166 [2018-04-10 14:18:19,398 INFO L226 Difference]: Without dead ends: 166 [2018-04-10 14:18:19,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:18:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-10 14:18:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 103. [2018-04-10 14:18:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-10 14:18:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-04-10 14:18:19,402 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 21 [2018-04-10 14:18:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:19,403 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-04-10 14:18:19,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:18:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-04-10 14:18:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-10 14:18:19,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:19,403 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] [2018-04-10 14:18:19,403 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:19,403 INFO L82 PathProgramCache]: Analyzing trace with hash -162564279, now seen corresponding path program 1 times [2018-04-10 14:18:19,404 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:19,404 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:19,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:19,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:19,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:19,460 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-10 14:18:19,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:19,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:18:19,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:18:19,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:18:19,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:18:19,461 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 8 states. [2018-04-10 14:18:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:19,628 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-04-10 14:18:19,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:18:19,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-10 14:18:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:19,629 INFO L225 Difference]: With dead ends: 151 [2018-04-10 14:18:19,629 INFO L226 Difference]: Without dead ends: 151 [2018-04-10 14:18:19,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:18:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-10 14:18:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2018-04-10 14:18:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-10 14:18:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-04-10 14:18:19,632 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 25 [2018-04-10 14:18:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:19,632 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-04-10 14:18:19,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:18:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-04-10 14:18:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-10 14:18:19,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:19,633 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] [2018-04-10 14:18:19,633 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash -162564278, now seen corresponding path program 1 times [2018-04-10 14:18:19,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:19,633 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:19,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:19,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:19,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:19,736 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-10 14:18:19,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:19,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:18:19,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:18:19,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:18:19,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:18:19,737 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 8 states. [2018-04-10 14:18:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:20,054 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-04-10 14:18:20,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:18:20,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-10 14:18:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:20,056 INFO L225 Difference]: With dead ends: 162 [2018-04-10 14:18:20,056 INFO L226 Difference]: Without dead ends: 162 [2018-04-10 14:18:20,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:18:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-10 14:18:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 103. [2018-04-10 14:18:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-10 14:18:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-04-10 14:18:20,059 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 25 [2018-04-10 14:18:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:20,059 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-04-10 14:18:20,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:18:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-04-10 14:18:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:18:20,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:20,060 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:20,060 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash -744985006, now seen corresponding path program 1 times [2018-04-10 14:18:20,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:20,060 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:20,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:20,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:20,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:20,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:20,106 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-10 14:18:20,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:20,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:18:20,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:18:20,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:18:20,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:18:20,107 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-04-10 14:18:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:20,287 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-04-10 14:18:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:18:20,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-04-10 14:18:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:20,288 INFO L225 Difference]: With dead ends: 141 [2018-04-10 14:18:20,288 INFO L226 Difference]: Without dead ends: 141 [2018-04-10 14:18:20,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:18:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-10 14:18:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2018-04-10 14:18:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-10 14:18:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-04-10 14:18:20,291 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 26 [2018-04-10 14:18:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:20,291 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-04-10 14:18:20,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:18:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-04-10 14:18:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:18:20,292 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:20,292 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:20,292 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash -744985005, now seen corresponding path program 1 times [2018-04-10 14:18:20,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:20,293 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:20,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:20,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:20,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:20,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:20,411 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-10 14:18:20,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:20,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:18:20,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:18:20,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:18:20,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:18:20,412 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 9 states. [2018-04-10 14:18:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:20,744 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2018-04-10 14:18:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:18:20,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-10 14:18:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:20,745 INFO L225 Difference]: With dead ends: 168 [2018-04-10 14:18:20,746 INFO L226 Difference]: Without dead ends: 168 [2018-04-10 14:18:20,746 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:18:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-10 14:18:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 130. [2018-04-10 14:18:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 14:18:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-04-10 14:18:20,749 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 26 [2018-04-10 14:18:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:20,749 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-04-10 14:18:20,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:18:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-04-10 14:18:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:18:20,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:20,750 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-10 14:18:20,750 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash 898807095, now seen corresponding path program 1 times [2018-04-10 14:18:20,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:20,751 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:20,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:20,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:20,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:20,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:20,805 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-10 14:18:20,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:20,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:18:20,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:18:20,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:18:20,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:18:20,806 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 8 states. [2018-04-10 14:18:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:20,992 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-04-10 14:18:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:18:20,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-10 14:18:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:20,992 INFO L225 Difference]: With dead ends: 154 [2018-04-10 14:18:20,993 INFO L226 Difference]: Without dead ends: 154 [2018-04-10 14:18:20,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:18:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-10 14:18:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-04-10 14:18:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 14:18:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2018-04-10 14:18:20,996 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 30 [2018-04-10 14:18:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:20,996 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2018-04-10 14:18:20,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:18:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2018-04-10 14:18:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:18:20,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:20,997 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:20,997 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash 898807096, now seen corresponding path program 1 times [2018-04-10 14:18:20,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:20,998 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:20,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:20,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:20,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:21,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:21,088 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-10 14:18:21,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:21,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:18:21,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:18:21,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:18:21,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:18:21,090 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 8 states. [2018-04-10 14:18:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:21,313 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2018-04-10 14:18:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:18:21,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-10 14:18:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:21,314 INFO L225 Difference]: With dead ends: 160 [2018-04-10 14:18:21,314 INFO L226 Difference]: Without dead ends: 160 [2018-04-10 14:18:21,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:18:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-10 14:18:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2018-04-10 14:18:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 14:18:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2018-04-10 14:18:21,317 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 30 [2018-04-10 14:18:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:21,317 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2018-04-10 14:18:21,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:18:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2018-04-10 14:18:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:18:21,318 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:21,318 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-10 14:18:21,318 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1546965158, now seen corresponding path program 1 times [2018-04-10 14:18:21,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:21,318 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:21,319 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:21,320 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:21,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:21,348 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-10 14:18:21,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:21,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:18:21,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:18:21,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:18:21,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:18:21,349 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand 3 states. [2018-04-10 14:18:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:21,359 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2018-04-10 14:18:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:18:21,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-10 14:18:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:21,362 INFO L225 Difference]: With dead ends: 200 [2018-04-10 14:18:21,362 INFO L226 Difference]: Without dead ends: 200 [2018-04-10 14:18:21,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:18:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-10 14:18:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2018-04-10 14:18:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 14:18:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2018-04-10 14:18:21,367 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 30 [2018-04-10 14:18:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:21,367 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2018-04-10 14:18:21,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:18:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2018-04-10 14:18:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 14:18:21,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:21,368 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:21,368 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:21,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1616801948, now seen corresponding path program 1 times [2018-04-10 14:18:21,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:21,369 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:21,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:21,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:21,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:21,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:21,515 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-10 14:18:21,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:21,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:18:21,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:18:21,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:18:21,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:18:21,517 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand 8 states. [2018-04-10 14:18:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:21,687 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2018-04-10 14:18:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:18:21,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-10 14:18:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:21,688 INFO L225 Difference]: With dead ends: 178 [2018-04-10 14:18:21,688 INFO L226 Difference]: Without dead ends: 173 [2018-04-10 14:18:21,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:18:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-10 14:18:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144. [2018-04-10 14:18:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-10 14:18:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2018-04-10 14:18:21,692 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 32 [2018-04-10 14:18:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:21,693 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2018-04-10 14:18:21,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:18:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2018-04-10 14:18:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 14:18:21,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:21,693 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:21,693 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash 205939541, now seen corresponding path program 1 times [2018-04-10 14:18:21,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:21,694 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:21,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:21,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:21,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:21,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:21,760 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:21,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:21,860 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-10 14:18:21,862 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-10 14:18:21,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:21,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:21,865 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-10 14:18:21,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:18:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:21,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:21,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2018-04-10 14:18:21,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:18:21,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:18:21,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:18:21,894 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand 10 states. [2018-04-10 14:18:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:22,173 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2018-04-10 14:18:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:18:22,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-04-10 14:18:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:22,174 INFO L225 Difference]: With dead ends: 160 [2018-04-10 14:18:22,174 INFO L226 Difference]: Without dead ends: 160 [2018-04-10 14:18:22,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:18:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-10 14:18:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2018-04-10 14:18:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-10 14:18:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2018-04-10 14:18:22,178 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 33 [2018-04-10 14:18:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:22,178 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2018-04-10 14:18:22,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:18:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2018-04-10 14:18:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 14:18:22,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:22,179 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:22,179 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash 205939542, now seen corresponding path program 1 times [2018-04-10 14:18:22,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:22,180 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:22,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:22,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:22,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:22,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:22,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:22,294 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:22,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:22,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:22,337 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 23 treesize of output 19 [2018-04-10 14:18:22,338 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 19 treesize of output 11 [2018-04-10 14:18:22,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:22,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:22,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:18:22,345 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 22 treesize of output 13 [2018-04-10 14:18:22,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:22,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:22,351 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-10 14:18:22,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:18:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:22,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:22,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-04-10 14:18:22,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:18:22,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:18:22,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:18:22,387 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand 13 states. [2018-04-10 14:18:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:23,038 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-04-10 14:18:23,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:18:23,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-04-10 14:18:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:23,038 INFO L225 Difference]: With dead ends: 191 [2018-04-10 14:18:23,039 INFO L226 Difference]: Without dead ends: 191 [2018-04-10 14:18:23,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:18:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-10 14:18:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2018-04-10 14:18:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 14:18:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-04-10 14:18:23,041 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 33 [2018-04-10 14:18:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:23,041 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-04-10 14:18:23,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:18:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-04-10 14:18:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 14:18:23,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:23,042 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:23,042 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1215484856, now seen corresponding path program 1 times [2018-04-10 14:18:23,042 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:23,042 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:23,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:23,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:23,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:23,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:23,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:23,237 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:23,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:23,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:23,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:23,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:23,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:23,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-10 14:18:23,284 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 19 treesize of output 12 [2018-04-10 14:18:23,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 12 treesize of output 11 [2018-04-10 14:18:23,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:29 [2018-04-10 14:18:23,304 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 26 treesize of output 20 [2018-04-10 14:18:23,306 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 11 [2018-04-10 14:18:23,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,314 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-10 14:18:23,316 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-10 14:18:23,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,320 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-10 14:18:23,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:11 [2018-04-10 14:18:23,340 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-10 14:18:23,341 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-10 14:18:23,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,345 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-10 14:18:23,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-10 14:18:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:18:23,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:23,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 14 [2018-04-10 14:18:23,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:18:23,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:18:23,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:18:23,372 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 14 states. [2018-04-10 14:18:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:23,669 INFO L93 Difference]: Finished difference Result 170 states and 189 transitions. [2018-04-10 14:18:23,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 14:18:23,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-10 14:18:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:23,671 INFO L225 Difference]: With dead ends: 170 [2018-04-10 14:18:23,671 INFO L226 Difference]: Without dead ends: 170 [2018-04-10 14:18:23,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:18:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-10 14:18:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2018-04-10 14:18:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 14:18:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2018-04-10 14:18:23,674 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 34 [2018-04-10 14:18:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:23,674 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2018-04-10 14:18:23,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:18:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2018-04-10 14:18:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:18:23,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:23,675 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:23,675 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1156332737, now seen corresponding path program 1 times [2018-04-10 14:18:23,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:23,676 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:23,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:23,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:23,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:23,777 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-10 14:18:23,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:23,777 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:23,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:23,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:23,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:23,813 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-10 14:18:23,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:18:23,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:23,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:23,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,852 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-10 14:18:23,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:18:23,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-10 14:18:23,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:23,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:23,932 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-10 14:18:23,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-10 14:18:23,997 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-10 14:18:24,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:18:24,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:24,008 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-10 14:18:24,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:24,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:24,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:24,017 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-10 14:18:24,064 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-10 14:18:24,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:24,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-04-10 14:18:24,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:18:24,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:18:24,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:18:24,097 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 19 states. [2018-04-10 14:18:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:24,767 INFO L93 Difference]: Finished difference Result 311 states and 352 transitions. [2018-04-10 14:18:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:18:24,767 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-04-10 14:18:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:24,768 INFO L225 Difference]: With dead ends: 311 [2018-04-10 14:18:24,768 INFO L226 Difference]: Without dead ends: 311 [2018-04-10 14:18:24,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:18:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-10 14:18:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 222. [2018-04-10 14:18:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-10 14:18:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 258 transitions. [2018-04-10 14:18:24,771 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 258 transitions. Word has length 35 [2018-04-10 14:18:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:24,772 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 258 transitions. [2018-04-10 14:18:24,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:18:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 258 transitions. [2018-04-10 14:18:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:18:24,772 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:24,772 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:24,772 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1156332738, now seen corresponding path program 1 times [2018-04-10 14:18:24,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:24,772 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:24,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:24,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:24,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:24,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:25,028 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-10 14:18:25,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:25,028 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:25,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:25,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:25,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:18:25,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:25,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:25,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:18:25,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:18:25,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:25,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:25,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18: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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:25,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:25,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,153 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-10 14:18:25,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:18:25,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-10 14:18:25,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:18:25,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-10 14:18:25,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:25,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,239 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-10 14:18:25,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-10 14:18:25,280 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-10 14:18:25,283 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-10 14:18:25,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,288 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-10 14:18:25,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-10 14:18:25,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:18:25,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,307 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-10 14:18:25,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,312 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-10 14:18:25,330 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-10 14:18:25,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:25,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-04-10 14:18:25,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 14:18:25,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 14:18:25,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:18:25,360 INFO L87 Difference]: Start difference. First operand 222 states and 258 transitions. Second operand 15 states. [2018-04-10 14:18:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:25,721 INFO L93 Difference]: Finished difference Result 292 states and 332 transitions. [2018-04-10 14:18:25,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:18:25,721 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-10 14:18:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:25,722 INFO L225 Difference]: With dead ends: 292 [2018-04-10 14:18:25,722 INFO L226 Difference]: Without dead ends: 292 [2018-04-10 14:18:25,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:18:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-10 14:18:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 243. [2018-04-10 14:18:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 14:18:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2018-04-10 14:18:25,726 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 35 [2018-04-10 14:18:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:25,726 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 285 transitions. [2018-04-10 14:18:25,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 14:18:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 285 transitions. [2018-04-10 14:18:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:18:25,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:25,726 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:25,726 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash -248460100, now seen corresponding path program 1 times [2018-04-10 14:18:25,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:25,727 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:25,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:25,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:25,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:25,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:25,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:25,791 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:25,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:25,815 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-10 14:18:25,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:25,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:18:25,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:25,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-10 14:18:25,910 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 38 treesize of output 33 [2018-04-10 14:18:25,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-10 14:18:25,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,919 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-10 14:18:25,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:24 [2018-04-10 14:18:25,949 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:18:25,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-04-10 14:18:25,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:18:25,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:25,954 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-10 14:18:25,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2018-04-10 14:18:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:25,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:25,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-04-10 14:18:25,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 14:18:25,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 14:18:25,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=172, Unknown=3, NotChecked=0, Total=210 [2018-04-10 14:18:25,976 INFO L87 Difference]: Start difference. First operand 243 states and 285 transitions. Second operand 15 states. [2018-04-10 14:18:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:26,250 INFO L93 Difference]: Finished difference Result 256 states and 287 transitions. [2018-04-10 14:18:26,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:18:26,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-04-10 14:18:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:26,251 INFO L225 Difference]: With dead ends: 256 [2018-04-10 14:18:26,251 INFO L226 Difference]: Without dead ends: 256 [2018-04-10 14:18:26,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=381, Unknown=3, NotChecked=0, Total=506 [2018-04-10 14:18:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-10 14:18:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 243. [2018-04-10 14:18:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 14:18:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2018-04-10 14:18:26,255 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 37 [2018-04-10 14:18:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:26,256 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2018-04-10 14:18:26,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 14:18:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2018-04-10 14:18:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:18:26,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:26,257 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:26,257 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:26,257 INFO L82 PathProgramCache]: Analyzing trace with hash -248460099, now seen corresponding path program 1 times [2018-04-10 14:18:26,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:26,257 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:26,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:26,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:26,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:26,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:26,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:26,429 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:26,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:26,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:26,461 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-10 14:18:26,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:26,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,467 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-10 14:18:26,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:26,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-10 14:18:26,637 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 38 treesize of output 28 [2018-04-10 14:18:26,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:18:26,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,651 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 13 [2018-04-10 14:18:26,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-10 14:18:26,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:26,668 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-10 14:18:26,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:13 [2018-04-10 14:18:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 14:18:26,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:26,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-04-10 14:18:26,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:18:26,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:18:26,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:18:26,705 INFO L87 Difference]: Start difference. First operand 243 states and 284 transitions. Second operand 16 states. [2018-04-10 14:18:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:27,334 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2018-04-10 14:18:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:18:27,334 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-04-10 14:18:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:27,335 INFO L225 Difference]: With dead ends: 255 [2018-04-10 14:18:27,336 INFO L226 Difference]: Without dead ends: 255 [2018-04-10 14:18:27,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:18:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-10 14:18:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 234. [2018-04-10 14:18:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-10 14:18:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2018-04-10 14:18:27,340 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 37 [2018-04-10 14:18:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:27,340 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2018-04-10 14:18:27,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:18:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2018-04-10 14:18:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 14:18:27,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:27,341 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] [2018-04-10 14:18:27,341 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1194594344, now seen corresponding path program 1 times [2018-04-10 14:18:27,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:27,341 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:27,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:27,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:27,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:27,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:27,456 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-10 14:18:27,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:27,456 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:27,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:27,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:27,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:27,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:27,507 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-10 14:18:27,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:18:27,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:27,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:27,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:27,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:27,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,555 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-10 14:18:27,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:18:27,613 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 55 treesize of output 51 [2018-04-10 14:18:27,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:27,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-04-10 14:18:27,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:27,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,641 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2018-04-10 14:18:27,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 14:18:27,662 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 20 [2018-04-10 14:18:27,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,667 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-10 14:18:27,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,675 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-10 14:18:27,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:35 [2018-04-10 14:18:27,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-04-10 14:18:27,726 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-10 14:18:27,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 14:18:27,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:27,732 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-10 14:18:27,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-04-10 14:18:27,737 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-10 14:18:27,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:27,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-04-10 14:18:27,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:18:27,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:18:27,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:18:27,765 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand 19 states. [2018-04-10 14:18:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:28,405 INFO L93 Difference]: Finished difference Result 285 states and 313 transitions. [2018-04-10 14:18:28,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:18:28,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-10 14:18:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:28,406 INFO L225 Difference]: With dead ends: 285 [2018-04-10 14:18:28,406 INFO L226 Difference]: Without dead ends: 285 [2018-04-10 14:18:28,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:18:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-10 14:18:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2018-04-10 14:18:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-10 14:18:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 266 transitions. [2018-04-10 14:18:28,409 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 266 transitions. Word has length 39 [2018-04-10 14:18:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:28,409 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 266 transitions. [2018-04-10 14:18:28,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:18:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions. [2018-04-10 14:18:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 14:18:28,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:28,409 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] [2018-04-10 14:18:28,409 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:28,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1194594345, now seen corresponding path program 1 times [2018-04-10 14:18:28,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:28,410 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:28,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:28,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:28,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:28,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:28,544 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-10 14:18:28,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:28,544 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:28,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:28,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:28,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:28,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:28,594 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-10 14:18:28,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,601 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-10 14:18:28,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-04-10 14:18:28,621 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-10 14:18:28,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:28,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,636 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-10 14:18:28,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:28,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,647 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-10 14:18:28,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-10 14:18:28,701 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 60 [2018-04-10 14:18:28,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:28,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-04-10 14:18:28,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:28,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:60 [2018-04-10 14:18:28,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2018-04-10 14:18:28,814 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 19 treesize of output 3 [2018-04-10 14:18:28,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-10 14:18:28,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:28,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:28,840 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 23 treesize of output 19 [2018-04-10 14:18:28,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:18:28,842 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:28,847 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-10 14:18:28,847 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,848 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:28,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:28,854 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:22 [2018-04-10 14:18:28,885 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-10 14:18:28,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:28,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-04-10 14:18:28,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 14:18:28,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 14:18:28,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:18:28,904 INFO L87 Difference]: Start difference. First operand 234 states and 266 transitions. Second operand 25 states. [2018-04-10 14:18:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:30,181 INFO L93 Difference]: Finished difference Result 287 states and 314 transitions. [2018-04-10 14:18:30,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:18:30,181 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-04-10 14:18:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:30,182 INFO L225 Difference]: With dead ends: 287 [2018-04-10 14:18:30,182 INFO L226 Difference]: Without dead ends: 287 [2018-04-10 14:18:30,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=333, Invalid=1559, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:18:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-10 14:18:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 234. [2018-04-10 14:18:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-10 14:18:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2018-04-10 14:18:30,185 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 39 [2018-04-10 14:18:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:30,185 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2018-04-10 14:18:30,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 14:18:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2018-04-10 14:18:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 14:18:30,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:30,185 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] [2018-04-10 14:18:30,186 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1622740652, now seen corresponding path program 1 times [2018-04-10 14:18:30,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:30,186 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:30,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:30,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:30,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:30,319 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-10 14:18:30,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:30,319 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:30,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:30,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:30,391 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 23 treesize of output 19 [2018-04-10 14:18:30,392 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 19 treesize of output 11 [2018-04-10 14:18:30,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:30,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:30,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:18:30,399 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 22 treesize of output 13 [2018-04-10 14:18:30,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:30,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:30,403 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-10 14:18:30,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:18:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:18:30,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:30,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2018-04-10 14:18:30,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:18:30,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:18:30,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:18:30,473 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand 19 states. [2018-04-10 14:18:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:31,426 INFO L93 Difference]: Finished difference Result 312 states and 344 transitions. [2018-04-10 14:18:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 14:18:31,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-04-10 14:18:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:31,427 INFO L225 Difference]: With dead ends: 312 [2018-04-10 14:18:31,427 INFO L226 Difference]: Without dead ends: 312 [2018-04-10 14:18:31,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=373, Invalid=2077, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:18:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-10 14:18:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 230. [2018-04-10 14:18:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 14:18:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 259 transitions. [2018-04-10 14:18:31,430 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 259 transitions. Word has length 40 [2018-04-10 14:18:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:31,430 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 259 transitions. [2018-04-10 14:18:31,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:18:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2018-04-10 14:18:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 14:18:31,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:31,431 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:31,431 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1350840412, now seen corresponding path program 1 times [2018-04-10 14:18:31,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:31,431 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:31,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:31,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:31,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:31,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 14:18:31,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:31,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:18:31,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:18:31,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:18:31,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:18:31,460 INFO L87 Difference]: Start difference. First operand 230 states and 259 transitions. Second operand 5 states. [2018-04-10 14:18:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:31,519 INFO L93 Difference]: Finished difference Result 232 states and 260 transitions. [2018-04-10 14:18:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:18:31,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-10 14:18:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:31,520 INFO L225 Difference]: With dead ends: 232 [2018-04-10 14:18:31,520 INFO L226 Difference]: Without dead ends: 232 [2018-04-10 14:18:31,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10 14:18:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-10 14:18:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-04-10 14:18:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 14:18:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 257 transitions. [2018-04-10 14:18:31,523 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 257 transitions. Word has length 42 [2018-04-10 14:18:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:31,523 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 257 transitions. [2018-04-10 14:18:31,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:18:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 257 transitions. [2018-04-10 14:18:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 14:18:31,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:31,524 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:31,524 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1350840411, now seen corresponding path program 1 times [2018-04-10 14:18:31,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:31,525 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:31,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:31,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:31,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:31,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:31,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:31,679 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:31,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:31,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:31,748 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 23 treesize of output 19 [2018-04-10 14:18:31,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-10 14:18:31,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:31,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:31,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:18:31,755 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 22 treesize of output 13 [2018-04-10 14:18:31,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:31,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:31,767 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-10 14:18:31,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:18:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 14:18:31,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:31,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-04-10 14:18:31,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:18:31,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:18:31,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:18:31,798 INFO L87 Difference]: Start difference. First operand 229 states and 257 transitions. Second operand 14 states. [2018-04-10 14:18:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:32,379 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2018-04-10 14:18:32,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:18:32,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-04-10 14:18:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:32,380 INFO L225 Difference]: With dead ends: 253 [2018-04-10 14:18:32,380 INFO L226 Difference]: Without dead ends: 253 [2018-04-10 14:18:32,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:18:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-10 14:18:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 228. [2018-04-10 14:18:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-10 14:18:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 255 transitions. [2018-04-10 14:18:32,384 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 255 transitions. Word has length 42 [2018-04-10 14:18:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:32,385 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 255 transitions. [2018-04-10 14:18:32,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:18:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 255 transitions. [2018-04-10 14:18:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 14:18:32,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:32,385 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] [2018-04-10 14:18:32,386 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash -380634463, now seen corresponding path program 1 times [2018-04-10 14:18:32,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:32,386 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:32,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:32,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:32,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:32,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:32,562 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-10 14:18:32,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:32,563 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:32,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:32,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:32,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:18:32,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:18:32,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:32,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:32,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:32,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:32,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,617 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-10 14:18:32,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:18:32,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 14:18:32,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:18:32,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-04-10 14:18:32,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-10 14:18:32,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:32,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,687 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-10 14:18:32,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-10 14:18:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:18:32,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:18:32,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:32,745 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-10 14:18:32,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,748 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2018-04-10 14:18:32,766 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-10 14:18:32,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:32,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2018-04-10 14:18:32,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:18:32,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:18:32,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:18:32,785 INFO L87 Difference]: Start difference. First operand 228 states and 255 transitions. Second operand 22 states. [2018-04-10 14:18:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:33,366 INFO L93 Difference]: Finished difference Result 277 states and 308 transitions. [2018-04-10 14:18:33,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:18:33,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-04-10 14:18:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:33,367 INFO L225 Difference]: With dead ends: 277 [2018-04-10 14:18:33,367 INFO L226 Difference]: Without dead ends: 277 [2018-04-10 14:18:33,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:18:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-10 14:18:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 250. [2018-04-10 14:18:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-10 14:18:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2018-04-10 14:18:33,370 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 42 [2018-04-10 14:18:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:33,370 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2018-04-10 14:18:33,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:18:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2018-04-10 14:18:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 14:18:33,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:33,371 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:33,371 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash -717444972, now seen corresponding path program 1 times [2018-04-10 14:18:33,371 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:33,371 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:33,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:33,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:33,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:33,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:33,483 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-10 14:18:33,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:33,483 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:33,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:33,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:33,567 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 25 treesize of output 21 [2018-04-10 14:18:33,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-10 14:18:33,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,576 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-10 14:18:33,577 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 9 [2018-04-10 14:18:33,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,579 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-10 14:18:33,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2018-04-10 14:18:33,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:18:33,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:18:33,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,605 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-10 14:18:33,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-04-10 14:18:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:18:33,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:33,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2018-04-10 14:18:33,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:18:33,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:18:33,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:18:33,636 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand 19 states. [2018-04-10 14:18:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:34,425 INFO L93 Difference]: Finished difference Result 313 states and 341 transitions. [2018-04-10 14:18:34,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 14:18:34,425 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-04-10 14:18:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:34,426 INFO L225 Difference]: With dead ends: 313 [2018-04-10 14:18:34,426 INFO L226 Difference]: Without dead ends: 313 [2018-04-10 14:18:34,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=1878, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:18:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-10 14:18:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 256. [2018-04-10 14:18:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-10 14:18:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 289 transitions. [2018-04-10 14:18:34,432 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 289 transitions. Word has length 44 [2018-04-10 14:18:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:34,432 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 289 transitions. [2018-04-10 14:18:34,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:18:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 289 transitions. [2018-04-10 14:18:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 14:18:34,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:34,433 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:34,433 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:34,433 INFO L82 PathProgramCache]: Analyzing trace with hash -868780152, now seen corresponding path program 1 times [2018-04-10 14:18:34,433 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:34,433 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:34,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:34,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:34,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:34,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:34,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:34,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:18:34,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:18:34,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:18:34,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:18:34,459 INFO L87 Difference]: Start difference. First operand 256 states and 289 transitions. Second operand 3 states. [2018-04-10 14:18:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:34,470 INFO L93 Difference]: Finished difference Result 389 states and 435 transitions. [2018-04-10 14:18:34,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:18:34,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-04-10 14:18:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:34,472 INFO L225 Difference]: With dead ends: 389 [2018-04-10 14:18:34,472 INFO L226 Difference]: Without dead ends: 389 [2018-04-10 14:18:34,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:18:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-10 14:18:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 279. [2018-04-10 14:18:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-10 14:18:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 313 transitions. [2018-04-10 14:18:34,480 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 313 transitions. Word has length 45 [2018-04-10 14:18:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:34,481 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 313 transitions. [2018-04-10 14:18:34,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:18:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2018-04-10 14:18:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:18:34,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:34,482 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:34,482 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash 440332197, now seen corresponding path program 1 times [2018-04-10 14:18:34,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:34,482 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:34,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:34,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:34,487 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:34,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:34,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:34,857 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:34,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:34,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:34,885 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-10 14:18:34,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:34,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,891 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-10 14:18:34,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:34,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-10 14:18:34,917 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-10 14:18:34,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:34,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-10 14:18:34,984 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 38 treesize of output 28 [2018-04-10 14:18:34,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:18:34,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:34,999 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 19 treesize of output 16 [2018-04-10 14:18:35,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-10 14:18:35,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:35,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:35,008 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-10 14:18:35,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:9 [2018-04-10 14:18:35,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:18:35,039 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-10 14:18:35,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:35,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:35,042 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-10 14:18:35,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-10 14:18:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:18:35,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:35,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-04-10 14:18:35,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:18:35,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:18:35,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2018-04-10 14:18:35,078 INFO L87 Difference]: Start difference. First operand 279 states and 313 transitions. Second operand 21 states. [2018-04-10 14:18:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:35,895 INFO L93 Difference]: Finished difference Result 290 states and 322 transitions. [2018-04-10 14:18:35,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:18:35,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-04-10 14:18:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:35,896 INFO L225 Difference]: With dead ends: 290 [2018-04-10 14:18:35,896 INFO L226 Difference]: Without dead ends: 290 [2018-04-10 14:18:35,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=430, Invalid=1370, Unknown=6, NotChecked=0, Total=1806 [2018-04-10 14:18:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-10 14:18:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 279. [2018-04-10 14:18:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-10 14:18:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 311 transitions. [2018-04-10 14:18:35,899 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 311 transitions. Word has length 46 [2018-04-10 14:18:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:35,899 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 311 transitions. [2018-04-10 14:18:35,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:18:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 311 transitions. [2018-04-10 14:18:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:18:35,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:35,900 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] [2018-04-10 14:18:35,900 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1980239269, now seen corresponding path program 1 times [2018-04-10 14:18:35,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:35,900 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:35,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:35,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:35,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:35,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:36,171 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-10 14:18:36,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:36,171 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:36,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:36,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:36,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:36,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:36,212 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-10 14:18:36,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:18:36,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:36,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:36,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,236 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-10 14:18:36,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:36,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,242 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-10 14:18:36,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-10 14:18:36,254 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-10 14:18:36,255 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-10 14:18:36,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-04-10 14:18:36,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:36,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-10 14:18:36,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:36,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:25 [2018-04-10 14:18:36,304 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 19 treesize of output 12 [2018-04-10 14:18:36,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:36,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-04-10 14:18:36,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 14:18:36,364 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 21 treesize of output 12 [2018-04-10 14:18:36,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,368 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-10 14:18:36,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:36,372 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-10 14:18:36,372 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2018-04-10 14:18:36,389 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-10 14:18:36,392 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 13 treesize of output 10 [2018-04-10 14:18:36,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:18:36,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:36,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:36,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2018-04-10 14:18:36,417 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-10 14:18:36,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:36,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-04-10 14:18:36,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:18:36,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:18:36,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:18:36,436 INFO L87 Difference]: Start difference. First operand 279 states and 311 transitions. Second operand 28 states. [2018-04-10 14:18:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:37,348 INFO L93 Difference]: Finished difference Result 332 states and 367 transitions. [2018-04-10 14:18:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:18:37,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-04-10 14:18:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:37,384 INFO L225 Difference]: With dead ends: 332 [2018-04-10 14:18:37,384 INFO L226 Difference]: Without dead ends: 331 [2018-04-10 14:18:37,384 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=2069, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:18:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-10 14:18:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 307. [2018-04-10 14:18:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-04-10 14:18:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 344 transitions. [2018-04-10 14:18:37,387 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 344 transitions. Word has length 46 [2018-04-10 14:18:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:37,387 INFO L459 AbstractCegarLoop]: Abstraction has 307 states and 344 transitions. [2018-04-10 14:18:37,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:18:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 344 transitions. [2018-04-10 14:18:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:18:37,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:37,388 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] [2018-04-10 14:18:37,388 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:37,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1578926161, now seen corresponding path program 1 times [2018-04-10 14:18:37,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:37,388 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:37,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:37,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:37,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:37,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:37,700 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-10 14:18:37,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:37,701 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:37,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:37,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:37,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:37,735 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-10 14:18:37,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:18:37,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-10 14:18:37,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:37,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,758 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-10 14:18:37,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:37,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,764 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-10 14:18:37,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:18:37,775 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-10 14:18:37,776 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-10 14:18:37,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-04-10 14:18:37,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:37,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-10 14:18:37,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:37,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-04-10 14:18:37,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-04-10 14:18:37,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:37,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-04-10 14:18:37,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 14:18:37,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-04-10 14:18:37,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,890 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-10 14:18:37,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:37,895 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2018-04-10 14:18:37,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:18:37,923 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 13 treesize of output 10 [2018-04-10 14:18:37,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:18:37,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:37,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:37,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2018-04-10 14:18:37,956 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-10 14:18:37,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:37,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-04-10 14:18:37,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:18:37,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:18:37,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:18:37,976 INFO L87 Difference]: Start difference. First operand 307 states and 344 transitions. Second operand 30 states. [2018-04-10 14:18:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:39,026 INFO L93 Difference]: Finished difference Result 321 states and 354 transitions. [2018-04-10 14:18:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:18:39,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2018-04-10 14:18:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:39,027 INFO L225 Difference]: With dead ends: 321 [2018-04-10 14:18:39,027 INFO L226 Difference]: Without dead ends: 320 [2018-04-10 14:18:39,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=401, Invalid=2251, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:18:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-10 14:18:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 268. [2018-04-10 14:18:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-10 14:18:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 298 transitions. [2018-04-10 14:18:39,029 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 298 transitions. Word has length 47 [2018-04-10 14:18:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:39,030 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 298 transitions. [2018-04-10 14:18:39,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:18:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 298 transitions. [2018-04-10 14:18:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 14:18:39,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:39,030 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:39,030 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1177193185, now seen corresponding path program 2 times [2018-04-10 14:18:39,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:39,030 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:39,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:39,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:39,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:39,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:39,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:39,329 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:39,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:18:39,362 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:18:39,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:18:39,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:39,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:39,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:39,407 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-10 14:18:39,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 14:18:39,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 14:18:39,448 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-10 14:18:39,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:39,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,463 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-10 14:18:39,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:39,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,476 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-10 14:18:39,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-04-10 14:18:39,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:39,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-04-10 14:18:39,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:39,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-04-10 14:18:39,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 12 treesize of output 11 [2018-04-10 14:18:39,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2018-04-10 14:18:39,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:39,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:39,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:39,610 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 20 treesize of output 21 [2018-04-10 14:18:39,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:18:39,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-04-10 14:18:39,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:39,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-04-10 14:18:39,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-10 14:18:39,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,695 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 30 treesize of output 36 [2018-04-10 14:18:39,697 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 11 [2018-04-10 14:18:39,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,710 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:60 [2018-04-10 14:18:39,844 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 113 treesize of output 88 [2018-04-10 14:18:39,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:18:39,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-10 14:18:39,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:39,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,888 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-10 14:18:39,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:99 [2018-04-10 14:18:39,946 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 96 treesize of output 59 [2018-04-10 14:18:39,947 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-10 14:18:39,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 14:18:39,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-10 14:18:39,962 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-10 14:18:39,967 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-10 14:18:39,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-10 14:18:39,977 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-10 14:18:39,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:18:39,980 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:39,986 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-10 14:18:39,987 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:110, output treesize:18 [2018-04-10 14:18:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:40,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:40,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2018-04-10 14:18:40,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:18:40,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:18:40,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:18:40,101 INFO L87 Difference]: Start difference. First operand 268 states and 298 transitions. Second operand 33 states. [2018-04-10 14:18:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:41,962 INFO L93 Difference]: Finished difference Result 451 states and 496 transitions. [2018-04-10 14:18:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:18:41,962 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-10 14:18:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:41,963 INFO L225 Difference]: With dead ends: 451 [2018-04-10 14:18:41,963 INFO L226 Difference]: Without dead ends: 451 [2018-04-10 14:18:41,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=607, Invalid=2933, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 14:18:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-10 14:18:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 326. [2018-04-10 14:18:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-10 14:18:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 365 transitions. [2018-04-10 14:18:41,967 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 365 transitions. Word has length 49 [2018-04-10 14:18:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:41,967 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 365 transitions. [2018-04-10 14:18:41,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:18:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 365 transitions. [2018-04-10 14:18:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:18:41,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:41,967 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:41,967 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:41,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1716645633, now seen corresponding path program 1 times [2018-04-10 14:18:41,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:41,968 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:41,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:41,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:18:41,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:41,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:42,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:42,168 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:42,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:42,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:42,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-10 14:18:42,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-10 14:18:42,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,296 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-10 14:18:42,297 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 9 [2018-04-10 14:18:42,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,300 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-10 14:18:42,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2018-04-10 14:18:42,329 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-10 14:18:42,330 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-10 14:18:42,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,332 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-10 14:18:42,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-10 14:18:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:18:42,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:42,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2018-04-10 14:18:42,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 14:18:42,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 14:18:42,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:18:42,383 INFO L87 Difference]: Start difference. First operand 326 states and 365 transitions. Second operand 25 states. [2018-04-10 14:18:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:44,059 INFO L93 Difference]: Finished difference Result 403 states and 443 transitions. [2018-04-10 14:18:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 14:18:44,060 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-10 14:18:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:44,060 INFO L225 Difference]: With dead ends: 403 [2018-04-10 14:18:44,061 INFO L226 Difference]: Without dead ends: 403 [2018-04-10 14:18:44,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1171, Invalid=5969, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 14:18:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-10 14:18:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 355. [2018-04-10 14:18:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-04-10 14:18:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 396 transitions. [2018-04-10 14:18:44,064 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 396 transitions. Word has length 50 [2018-04-10 14:18:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:44,064 INFO L459 AbstractCegarLoop]: Abstraction has 355 states and 396 transitions. [2018-04-10 14:18:44,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 14:18:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 396 transitions. [2018-04-10 14:18:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:18:44,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:44,065 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:44,065 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash -967821625, now seen corresponding path program 2 times [2018-04-10 14:18:44,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:44,065 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:44,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:44,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:44,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:44,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:44,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:44,275 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:44,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:18:44,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:18:44,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:18:44,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:44,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,359 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-10 14:18:44,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:18:44,395 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-10 14:18:44,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:44,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:44,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:44,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,419 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-10 14:18:44,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:32 [2018-04-10 14:18:44,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-10 14:18:44,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:44,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-04-10 14:18:44,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-10 14:18:44,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:62 [2018-04-10 14:18:44,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,594 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 26 treesize of output 46 [2018-04-10 14:18:44,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:79 [2018-04-10 14:18:44,685 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 45 treesize of output 51 [2018-04-10 14:18:44,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-04-10 14:18:44,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:44,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 67 [2018-04-10 14:18:44,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 14:18:44,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,752 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-10 14:18:44,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:77 [2018-04-10 14:18:44,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2018-04-10 14:18:44,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 19 [2018-04-10 14:18:44,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,879 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 125 treesize of output 100 [2018-04-10 14:18:44,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:18:44,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,907 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-10 14:18:44,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:117 [2018-04-10 14:18:44,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 88 [2018-04-10 14:18:44,952 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 70 treesize of output 57 [2018-04-10 14:18:44,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,957 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-10 14:18:44,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:44,968 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-10 14:18:44,968 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:128, output treesize:86 [2018-04-10 14:18:45,032 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 85 treesize of output 50 [2018-04-10 14:18:45,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 14:18:45,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:45,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 14:18:45,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:45,049 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-10 14:18:45,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:45,053 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-10 14:18:45,057 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-10 14:18:45,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-10 14:18:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:45,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:45,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2018-04-10 14:18:45,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:18:45,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:18:45,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:18:45,119 INFO L87 Difference]: Start difference. First operand 355 states and 396 transitions. Second operand 35 states. [2018-04-10 14:18:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:46,361 INFO L93 Difference]: Finished difference Result 485 states and 534 transitions. [2018-04-10 14:18:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:18:46,361 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 53 [2018-04-10 14:18:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:46,362 INFO L225 Difference]: With dead ends: 485 [2018-04-10 14:18:46,362 INFO L226 Difference]: Without dead ends: 485 [2018-04-10 14:18:46,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=551, Invalid=3231, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 14:18:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-10 14:18:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 356. [2018-04-10 14:18:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-04-10 14:18:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 398 transitions. [2018-04-10 14:18:46,366 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 398 transitions. Word has length 53 [2018-04-10 14:18:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:46,366 INFO L459 AbstractCegarLoop]: Abstraction has 356 states and 398 transitions. [2018-04-10 14:18:46,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:18:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 398 transitions. [2018-04-10 14:18:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:18:46,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:46,367 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:46,367 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash -967821624, now seen corresponding path program 2 times [2018-04-10 14:18:46,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:46,367 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:46,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:46,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:18:46,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:46,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:46,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:46,610 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:46,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:18:46,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:18:46,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:18:46,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:46,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,682 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-10 14:18:46,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:18:46,711 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-10 14:18:46,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:46,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,722 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-10 14:18:46,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:46,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,730 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-10 14:18:46,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:18:46,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-04-10 14:18:46,798 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 18 treesize of output 20 [2018-04-10 14:18:46,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-10 14:18:46,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:18:46,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:69 [2018-04-10 14:18:46,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,864 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 20 treesize of output 21 [2018-04-10 14:18:46,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:18:46,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-10 14:18:46,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 73 [2018-04-10 14:18:46,931 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 66 [2018-04-10 14:18:46,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:18:46,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:46,960 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:18:46,961 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 52 treesize of output 63 [2018-04-10 14:18:46,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-04-10 14:18:46,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,977 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-10 14:18:46,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-10 14:18:47,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 126 [2018-04-10 14:18:47,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 19 [2018-04-10 14:18:47,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,088 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 130 treesize of output 126 [2018-04-10 14:18:47,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 19 [2018-04-10 14:18:47,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,106 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-10 14:18:47,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:117 [2018-04-10 14:18:47,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 102 [2018-04-10 14:18:47,251 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 41 [2018-04-10 14:18:47,252 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:18:47,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-04-10 14:18:47,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:47,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:18:47,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,278 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-10 14:18:47,287 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 37 treesize of output 37 [2018-04-10 14:18:47,288 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-10 14:18:47,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,293 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-10 14:18:47,293 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,295 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-10 14:18:47,296 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,300 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-10 14:18:47,300 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:144, output treesize:9 [2018-04-10 14:18:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:47,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:47,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-04-10 14:18:47,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:18:47,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:18:47,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:18:47,338 INFO L87 Difference]: Start difference. First operand 356 states and 398 transitions. Second operand 33 states. [2018-04-10 14:18:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:48,475 INFO L93 Difference]: Finished difference Result 421 states and 467 transitions. [2018-04-10 14:18:48,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:18:48,475 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-04-10 14:18:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:48,476 INFO L225 Difference]: With dead ends: 421 [2018-04-10 14:18:48,476 INFO L226 Difference]: Without dead ends: 421 [2018-04-10 14:18:48,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=377, Invalid=2275, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:18:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-10 14:18:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 360. [2018-04-10 14:18:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-10 14:18:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 403 transitions. [2018-04-10 14:18:48,480 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 403 transitions. Word has length 53 [2018-04-10 14:18:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:48,480 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 403 transitions. [2018-04-10 14:18:48,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:18:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 403 transitions. [2018-04-10 14:18:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 14:18:48,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:48,481 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:48,481 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:48,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1445881053, now seen corresponding path program 1 times [2018-04-10 14:18:48,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:48,481 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:48,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:48,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:18:48,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:48,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:48,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:48,672 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:48,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:48,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:48,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:48,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:48,717 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-10 14:18:48,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:18:48,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:48,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:48,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:48,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:48,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,771 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-10 14:18:48,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-10 14:18:48,828 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 60 [2018-04-10 14:18:48,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 16 treesize of output 15 [2018-04-10 14:18:48,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-04-10 14:18:48,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:48,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:53 [2018-04-10 14:18:48,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-04-10 14:18:48,969 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-10 14:18:48,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:48,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-10 14:18:48,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:48,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:49,002 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-10 14:18:49,002 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:45 [2018-04-10 14:18:49,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-04-10 14:18:49,048 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-10 14:18:49,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:49,052 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-10 14:18:49,052 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:49,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:49,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:49,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-10 14:18:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:49,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:49,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-04-10 14:18:49,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 14:18:49,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 14:18:49,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:18:49,109 INFO L87 Difference]: Start difference. First operand 360 states and 403 transitions. Second operand 25 states. [2018-04-10 14:18:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:50,034 INFO L93 Difference]: Finished difference Result 419 states and 460 transitions. [2018-04-10 14:18:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 14:18:50,034 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-04-10 14:18:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:50,035 INFO L225 Difference]: With dead ends: 419 [2018-04-10 14:18:50,035 INFO L226 Difference]: Without dead ends: 419 [2018-04-10 14:18:50,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:18:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-04-10 14:18:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 361. [2018-04-10 14:18:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-10 14:18:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 405 transitions. [2018-04-10 14:18:50,038 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 405 transitions. Word has length 55 [2018-04-10 14:18:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:50,039 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 405 transitions. [2018-04-10 14:18:50,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 14:18:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 405 transitions. [2018-04-10 14:18:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 14:18:50,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:50,040 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:50,040 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1445881052, now seen corresponding path program 1 times [2018-04-10 14:18:50,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:50,040 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:50,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:50,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:50,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:50,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:50,278 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:50,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:50,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:50,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:50,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:50,319 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-10 14:18:50,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,327 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-10 14:18:50,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:18:50,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:50,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:50,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,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 11 treesize of output 8 [2018-04-10 14:18:50,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:50,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,359 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-10 14:18:50,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:18:50,378 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 54 treesize of output 55 [2018-04-10 14:18:50,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:18:50,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-10 14:18:50,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:18:50,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-04-10 14:18:50,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 79 [2018-04-10 14:18:50,558 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 33 treesize of output 17 [2018-04-10 14:18:50,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,567 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 59 treesize of output 36 [2018-04-10 14:18:50,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,579 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 34 treesize of output 26 [2018-04-10 14:18:50,597 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-10 14:18:50,597 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,601 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-10 14:18:50,601 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:50,604 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-10 14:18:50,604 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:117, output treesize:9 [2018-04-10 14:18:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:50,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:50,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-04-10 14:18:50,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:18:50,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:18:50,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:18:50,638 INFO L87 Difference]: Start difference. First operand 361 states and 405 transitions. Second operand 19 states. [2018-04-10 14:18:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:51,249 INFO L93 Difference]: Finished difference Result 403 states and 444 transitions. [2018-04-10 14:18:51,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:18:51,249 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-04-10 14:18:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:51,250 INFO L225 Difference]: With dead ends: 403 [2018-04-10 14:18:51,250 INFO L226 Difference]: Without dead ends: 403 [2018-04-10 14:18:51,250 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:18:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-10 14:18:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 361. [2018-04-10 14:18:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-10 14:18:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 404 transitions. [2018-04-10 14:18:51,253 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 404 transitions. Word has length 55 [2018-04-10 14:18:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:51,253 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 404 transitions. [2018-04-10 14:18:51,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:18:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 404 transitions. [2018-04-10 14:18:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 14:18:51,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:51,254 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:51,254 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash -700294238, now seen corresponding path program 2 times [2018-04-10 14:18:51,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:51,255 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:51,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:51,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:51,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:51,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:51,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:51,397 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:51,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:18:51,417 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:18:51,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:18:51,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:51,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:51,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:51,457 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-10 14:18:51,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:18:51,473 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-10 14:18:51,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:51,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,483 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-10 14:18:51,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:51,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,492 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-10 14:18:51,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-10 14:18:51,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 14:18:51,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:18:51,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2018-04-10 14:18:51,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-10 14:18:51,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 8 treesize of output 7 [2018-04-10 14:18:51,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-10 14:18:51,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:51,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:51,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:18:51,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-10 14:18:51,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:51,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:18:51,622 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 14 treesize of output 7 [2018-04-10 14:18:51,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,629 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-10 14:18:51,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:23 [2018-04-10 14:18:51,645 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 16 treesize of output 12 [2018-04-10 14:18:51,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:18:51,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,650 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-10 14:18:51,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2018-04-10 14:18:51,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-10 14:18:51,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:51,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,689 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-10 14:18:51,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-04-10 14:18:51,714 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-10 14:18:51,715 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-10 14:18:51,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:18:51,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:51,721 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-04-10 14:18:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:51,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:51,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-04-10 14:18:51,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:18:51,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:18:51,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:18:51,752 INFO L87 Difference]: Start difference. First operand 361 states and 404 transitions. Second operand 31 states. [2018-04-10 14:18:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:52,419 INFO L93 Difference]: Finished difference Result 406 states and 448 transitions. [2018-04-10 14:18:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:18:52,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-04-10 14:18:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:52,420 INFO L225 Difference]: With dead ends: 406 [2018-04-10 14:18:52,420 INFO L226 Difference]: Without dead ends: 406 [2018-04-10 14:18:52,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=461, Invalid=2191, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:18:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-04-10 14:18:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 361. [2018-04-10 14:18:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-10 14:18:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 404 transitions. [2018-04-10 14:18:52,423 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 404 transitions. Word has length 56 [2018-04-10 14:18:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:52,423 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 404 transitions. [2018-04-10 14:18:52,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:18:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 404 transitions. [2018-04-10 14:18:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 14:18:52,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:52,423 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:52,424 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1664512831, now seen corresponding path program 1 times [2018-04-10 14:18:52,424 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:52,424 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:52,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:52,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:18:52,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:52,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:52,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:52,561 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:52,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:52,595 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-10 14:18:52,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:52,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,601 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-10 14:18:52,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:52,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-10 14:18:52,694 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 38 treesize of output 33 [2018-04-10 14:18:52,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-10 14:18:52,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,707 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-10 14:18:52,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:24 [2018-04-10 14:18:52,743 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:18:52,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-04-10 14:18:52,745 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-10 14:18:52,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:52,748 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-10 14:18:52,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2018-04-10 14:18:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 14:18:52,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:52,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-04-10 14:18:52,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:18:52,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:18:52,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=260, Unknown=1, NotChecked=0, Total=306 [2018-04-10 14:18:52,773 INFO L87 Difference]: Start difference. First operand 361 states and 404 transitions. Second operand 18 states. [2018-04-10 14:18:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:53,136 INFO L93 Difference]: Finished difference Result 373 states and 415 transitions. [2018-04-10 14:18:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:18:53,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-04-10 14:18:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:53,137 INFO L225 Difference]: With dead ends: 373 [2018-04-10 14:18:53,137 INFO L226 Difference]: Without dead ends: 373 [2018-04-10 14:18:53,137 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=396, Unknown=1, NotChecked=0, Total=506 [2018-04-10 14:18:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-10 14:18:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 358. [2018-04-10 14:18:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-04-10 14:18:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 400 transitions. [2018-04-10 14:18:53,139 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 400 transitions. Word has length 57 [2018-04-10 14:18:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:53,139 INFO L459 AbstractCegarLoop]: Abstraction has 358 states and 400 transitions. [2018-04-10 14:18:53,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:18:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 400 transitions. [2018-04-10 14:18:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:18:53,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:53,140 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:53,140 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1792612314, now seen corresponding path program 1 times [2018-04-10 14:18:53,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:53,140 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:53,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:53,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:53,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:53,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:53,365 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:53,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:53,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:53,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:53,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:53,395 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-10 14:18:53,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:18:53,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:53,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:53,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:53,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:53,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,421 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-10 14:18:53,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:18:53,425 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-10 14:18:53,426 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-10 14:18:53,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-04-10 14:18:53,439 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 28 treesize of output 24 [2018-04-10 14:18:53,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:18:53,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-04-10 14:18:53,531 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 25 treesize of output 21 [2018-04-10 14:18:53,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-10 14:18:53,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,537 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-10 14:18:53,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:40 [2018-04-10 14:18:53,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-10 14:18:53,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:18:53,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,617 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 18 treesize of output 14 [2018-04-10 14:18:53,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:18:53,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:53,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:53,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:47, output treesize:21 [2018-04-10 14:18:53,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:53,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 14:18:53,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:53,679 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-10 14:18:53,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-10 14:18:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:53,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:53,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2018-04-10 14:18:53,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:18:53,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:18:53,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:18:53,723 INFO L87 Difference]: Start difference. First operand 358 states and 400 transitions. Second operand 32 states. [2018-04-10 14:18:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:54,662 INFO L93 Difference]: Finished difference Result 395 states and 435 transitions. [2018-04-10 14:18:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:18:54,662 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-04-10 14:18:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:54,663 INFO L225 Difference]: With dead ends: 395 [2018-04-10 14:18:54,663 INFO L226 Difference]: Without dead ends: 395 [2018-04-10 14:18:54,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=2704, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 14:18:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-10 14:18:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 377. [2018-04-10 14:18:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-10 14:18:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 420 transitions. [2018-04-10 14:18:54,666 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 420 transitions. Word has length 60 [2018-04-10 14:18:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:54,666 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 420 transitions. [2018-04-10 14:18:54,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:18:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 420 transitions. [2018-04-10 14:18:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:18:54,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:54,667 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:54,667 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1792612313, now seen corresponding path program 1 times [2018-04-10 14:18:54,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:54,667 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:54,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:54,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:54,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:54,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:55,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:55,090 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:55,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:55,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 74 [2018-04-10 14:18:55,242 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 67 treesize of output 52 [2018-04-10 14:18:55,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,255 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2018-04-10 14:18:55,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:18:55,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-04-10 14:18:55,275 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-10 14:18:55,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:18:55,306 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 48 treesize of output 42 [2018-04-10 14:18:55,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-10 14:18:55,308 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:55,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2018-04-10 14:18:55,338 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,344 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-04-10 14:18:55,349 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 28 treesize of output 13 [2018-04-10 14:18:55,349 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,356 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,361 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 40 treesize of output 36 [2018-04-10 14:18:55,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-10 14:18:55,363 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:55,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-10 14:18:55,382 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-04-10 14:18:55,394 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,399 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:55,404 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-10 14:18:55,405 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:79, output treesize:13 [2018-04-10 14:18:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:18:55,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:55,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9] total 31 [2018-04-10 14:18:55,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:18:55,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:18:55,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:18:55,497 INFO L87 Difference]: Start difference. First operand 377 states and 420 transitions. Second operand 32 states. [2018-04-10 14:18:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:58,211 INFO L93 Difference]: Finished difference Result 467 states and 509 transitions. [2018-04-10 14:18:58,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 14:18:58,212 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-04-10 14:18:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:58,212 INFO L225 Difference]: With dead ends: 467 [2018-04-10 14:18:58,213 INFO L226 Difference]: Without dead ends: 467 [2018-04-10 14:18:58,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1258, Invalid=6932, Unknown=0, NotChecked=0, Total=8190 [2018-04-10 14:18:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-10 14:18:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 390. [2018-04-10 14:18:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-04-10 14:18:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 435 transitions. [2018-04-10 14:18:58,216 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 435 transitions. Word has length 60 [2018-04-10 14:18:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:58,216 INFO L459 AbstractCegarLoop]: Abstraction has 390 states and 435 transitions. [2018-04-10 14:18:58,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:18:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 435 transitions. [2018-04-10 14:18:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:18:58,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:58,217 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:58,217 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:18:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash -252705242, now seen corresponding path program 2 times [2018-04-10 14:18:58,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:58,217 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:58,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:58,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:58,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:58,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:58,797 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:18:58,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:18:58,818 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:18:58,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:18:58,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:58,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:58,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:58,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 14:18:58,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-10 14:18:58,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:58,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:58,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:18:58,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:58,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,890 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-10 14:18:58,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-10 14:18:58,915 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-10 14:18:58,916 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-10 14:18:58,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:39 [2018-04-10 14:18:58,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:58,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:58,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-04-10 14:18:58,971 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 18 treesize of output 16 [2018-04-10 14:18:58,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:58,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-10 14:18:59,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, 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 14 [2018-04-10 14:18:59,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:18:59,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:55 [2018-04-10 14:18:59,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 14:18:59,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-04-10 14:18:59,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 67 [2018-04-10 14:18:59,097 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 47 [2018-04-10 14:18:59,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:18:59,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,117 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-10 14:18:59,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:50 [2018-04-10 14:18:59,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 82 [2018-04-10 14:18:59,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:59,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:56 [2018-04-10 14:18:59,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 38 [2018-04-10 14:18:59,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17 [2018-04-10 14:18:59,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:73 [2018-04-10 14:18:59,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:18:59,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-04-10 14:18:59,286 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 26 treesize of output 17 [2018-04-10 14:18:59,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,296 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-10 14:18:59,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:75 [2018-04-10 14:18:59,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:59,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2018-04-10 14:18:59,365 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-10 14:18:59,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-10 14:18:59,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:59,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 14:18:59,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,383 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-10 14:18:59,387 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-10 14:18:59,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:21 [2018-04-10 14:18:59,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-10 14:18:59,435 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 13 treesize of output 10 [2018-04-10 14:18:59,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:18:59,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:18:59,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:59,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:59,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:59,444 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:10 [2018-04-10 14:18:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:59,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:59,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 39 [2018-04-10 14:18:59,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 14:18:59,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 14:18:59,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1335, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:18:59,501 INFO L87 Difference]: Start difference. First operand 390 states and 435 transitions. Second operand 39 states. [2018-04-10 14:19:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:01,480 INFO L93 Difference]: Finished difference Result 587 states and 646 transitions. [2018-04-10 14:19:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 14:19:01,480 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 60 [2018-04-10 14:19:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:01,481 INFO L225 Difference]: With dead ends: 587 [2018-04-10 14:19:01,481 INFO L226 Difference]: Without dead ends: 586 [2018-04-10 14:19:01,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=643, Invalid=4613, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 14:19:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-04-10 14:19:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 446. [2018-04-10 14:19:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-10 14:19:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 497 transitions. [2018-04-10 14:19:01,484 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 497 transitions. Word has length 60 [2018-04-10 14:19:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:01,485 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 497 transitions. [2018-04-10 14:19:01,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 14:19:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 497 transitions. [2018-04-10 14:19:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 14:19:01,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:01,485 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:01,485 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:01,485 INFO L82 PathProgramCache]: Analyzing trace with hash 985684946, now seen corresponding path program 1 times [2018-04-10 14:19:01,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:01,486 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:01,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:01,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:19:01,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:01,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:02,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:02,181 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:02,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:02,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:02,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,224 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-10 14:19:02,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:19:02,241 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-10 14:19:02,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:02,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,252 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-10 14:19:02,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:02,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,259 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-10 14:19:02,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:19:02,275 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-10 14:19:02,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:19:02,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:24 [2018-04-10 14:19:02,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-10 14:19:02,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:02,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2018-04-10 14:19:02,356 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 14 [2018-04-10 14:19:02,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:02,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:43 [2018-04-10 14:19:02,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:19:02,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:45 [2018-04-10 14:19:02,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 14:19:02,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:02,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-04-10 14:19:02,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-10 14:19:02,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,461 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-10 14:19:02,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:50 [2018-04-10 14:19:02,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-04-10 14:19:02,489 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-10 14:19:02,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:49 [2018-04-10 14:19:02,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,550 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 3 case distinctions, treesize of input 54 treesize of output 74 [2018-04-10 14:19:02,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 56 treesize of output 41 [2018-04-10 14:19:02,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-10 14:19:02,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:02,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:02,604 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:63, output treesize:85 [2018-04-10 14:19:02,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 74 [2018-04-10 14:19:02,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:19:02,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,673 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:02,673 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 49 treesize of output 51 [2018-04-10 14:19:02,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:02,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-10 14:19:02,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:02,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:104 [2018-04-10 14:19:02,753 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 58 treesize of output 39 [2018-04-10 14:19:02,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 14:19:02,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 76 [2018-04-10 14:19:02,773 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 37 treesize of output 35 [2018-04-10 14:19:02,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:02,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:172, output treesize:90 [2018-04-10 14:19:02,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 14:19:02,848 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 21 treesize of output 12 [2018-04-10 14:19:02,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,851 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-10 14:19:02,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:02,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2018-04-10 14:19:02,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2018-04-10 14:19:02,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-04-10 14:19:02,879 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-10 14:19:02,896 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:02,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-10 14:19:02,907 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:02,920 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 36 treesize of output 31 [2018-04-10 14:19:02,920 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:02,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:02,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:02,949 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:104, output treesize:54 [2018-04-10 14:19:02,989 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-10 14:19:02,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:19:02,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:02,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:02,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:02,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2018-04-10 14:19:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:03,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:03,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2018-04-10 14:19:03,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:19:03,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:19:03,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1888, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:19:03,041 INFO L87 Difference]: Start difference. First operand 446 states and 497 transitions. Second operand 46 states. [2018-04-10 14:19:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:05,281 INFO L93 Difference]: Finished difference Result 581 states and 642 transitions. [2018-04-10 14:19:05,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 14:19:05,282 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 61 [2018-04-10 14:19:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:05,283 INFO L225 Difference]: With dead ends: 581 [2018-04-10 14:19:05,283 INFO L226 Difference]: Without dead ends: 574 [2018-04-10 14:19:05,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=756, Invalid=5406, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 14:19:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-10 14:19:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 446. [2018-04-10 14:19:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-10 14:19:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 497 transitions. [2018-04-10 14:19:05,286 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 497 transitions. Word has length 61 [2018-04-10 14:19:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:05,286 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 497 transitions. [2018-04-10 14:19:05,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:19:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 497 transitions. [2018-04-10 14:19:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 14:19:05,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:05,287 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:05,287 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1226419550, now seen corresponding path program 1 times [2018-04-10 14:19:05,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:05,287 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:05,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:05,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:05,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:05,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:05,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:05,547 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:05,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:05,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,582 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-10 14:19:05,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:19:05,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:05,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:05,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,599 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-10 14:19:05,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-10 14:19:05,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-10 14:19:05,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:05,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-10 14:19:05,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:19:05,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-10 14:19:05,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-04-10 14:19:05,679 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 12 [2018-04-10 14:19:05,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,689 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-10 14:19:05,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2018-04-10 14:19:05,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-04-10 14:19:05,769 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 61 treesize of output 60 [2018-04-10 14:19:05,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 39 [2018-04-10 14:19:05,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:05,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:05,838 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 2 xjuncts. [2018-04-10 14:19:05,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:83 [2018-04-10 14:19:05,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,895 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 45 treesize of output 57 [2018-04-10 14:19:05,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 77 [2018-04-10 14:19:05,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:05,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:115 [2018-04-10 14:19:05,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:06,009 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 3 case distinctions, treesize of input 86 treesize of output 97 [2018-04-10 14:19:06,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-04-10 14:19:06,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:06,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:06,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:06,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 82 [2018-04-10 14:19:06,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:06,141 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 75 treesize of output 80 [2018-04-10 14:19:06,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:19:06,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2018-04-10 14:19:06,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:06,156 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,167 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,195 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 66 treesize of output 61 [2018-04-10 14:19:06,197 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 7 [2018-04-10 14:19:06,197 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,206 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:06,233 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:153, output treesize:137 [2018-04-10 14:19:06,285 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 100 treesize of output 80 [2018-04-10 14:19:06,286 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-10 14:19:06,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-04-10 14:19:06,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:19:06,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:06,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:173, output treesize:127 [2018-04-10 14:19:06,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:06,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 114 [2018-04-10 14:19:06,450 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 14:19:06,461 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 14:19:06,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:06,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 71 [2018-04-10 14:19:06,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:07,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-04-10 14:19:07,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:07,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 75 [2018-04-10 14:19:07,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:07,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:07,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:07,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 74 [2018-04-10 14:19:07,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 14:19:07,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2018-04-10 14:19:07,830 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:07,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-0 vars, 8 dim-1 vars, End of recursive call: 8 dim-0 vars, and 11 xjuncts. [2018-04-10 14:19:08,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:08,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 86 [2018-04-10 14:19:08,157 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-10 14:19:08,157 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:08,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 58 treesize of output 57 [2018-04-10 14:19:08,232 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:08,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2018-04-10 14:19:08,276 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:08,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-10 14:19:08,312 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:08,344 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:08,374 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-10 14:19:08,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 34 dim-0 vars, and 15 xjuncts. [2018-04-10 14:19:08,571 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:143, output treesize:970 [2018-04-10 14:19:08,982 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 276 DAG size of output 110 [2018-04-10 14:19:08,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:08,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:08,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 63 [2018-04-10 14:19:09,002 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 34 [2018-04-10 14:19:09,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:09,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-10 14:19:09,015 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,020 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-10 14:19:09,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-04-10 14:19:09,074 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-10 14:19:09,074 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-10 14:19:09,081 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:09,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:09,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:09,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:09,134 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 1 case distinctions, treesize of input 91 treesize of output 66 [2018-04-10 14:19:09,138 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2018-04-10 14:19:09,139 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:09,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-10 14:19:09,157 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:09,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-10 14:19:09,170 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:09,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-04-10 14:19:09,183 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-04-10 14:19:09,199 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:09,215 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:09,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:09,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-04-10 14:19:09,276 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-04-10 14:19:09,276 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-10 14:19:09,282 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,286 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:09,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:09,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 95 [2018-04-10 14:19:09,359 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 79 [2018-04-10 14:19:09,360 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:09,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2018-04-10 14:19:09,481 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2018-04-10 14:19:09,486 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:09,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-04-10 14:19:09,601 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-04-10 14:19:09,603 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2018-04-10 14:19:09,701 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:09,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 67 [2018-04-10 14:19:09,804 INFO L267 ElimStorePlain]: Start of recursive call 25: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:09,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2018-04-10 14:19:09,929 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:10,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-10 14:19:10,050 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:10,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-10 14:19:10,174 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:10,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-10 14:19:10,177 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:10,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2018-04-10 14:19:10,312 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:10,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-10 14:19:10,313 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:10,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2018-04-10 14:19:10,315 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:10,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 58 [2018-04-10 14:19:10,430 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:10,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-04-10 14:19:10,531 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:10,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2018-04-10 14:19:10,638 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:10,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2018-04-10 14:19:10,752 INFO L267 ElimStorePlain]: Start of recursive call 36: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:10,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2018-04-10 14:19:10,957 INFO L267 ElimStorePlain]: Start of recursive call 37: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:11,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-04-10 14:19:11,113 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:11,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-10 14:19:11,283 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:11,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2018-04-10 14:19:11,448 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:11,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-04-10 14:19:11,604 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:11,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2018-04-10 14:19:11,766 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:11,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 56 [2018-04-10 14:19:11,939 INFO L267 ElimStorePlain]: Start of recursive call 43: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:12,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-10 14:19:12,129 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:12,325 INFO L267 ElimStorePlain]: Start of recursive call 18: 21 dim-1 vars, End of recursive call: 33 dim-0 vars, and 19 xjuncts. [2018-04-10 14:19:12,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2018-04-10 14:19:12,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-04-10 14:19:12,627 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-04-10 14:19:12,647 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:12,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-04-10 14:19:12,674 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-10 14:19:12,693 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:12,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 34 treesize of output 27 [2018-04-10 14:19:12,711 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,728 INFO L267 ElimStorePlain]: Start of recursive call 45: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:13,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 6 dim-2 vars, End of recursive call: 50 dim-0 vars, and 28 xjuncts. [2018-04-10 14:19:13,031 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 23 variables, input treesize:447, output treesize:643 [2018-04-10 14:19:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:13,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:13,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2018-04-10 14:19:13,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:19:13,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:19:13,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1045, Unknown=3, NotChecked=0, Total=1190 [2018-04-10 14:19:13,243 INFO L87 Difference]: Start difference. First operand 446 states and 497 transitions. Second operand 35 states. [2018-04-10 14:19:14,731 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 127 DAG size of output 90 [2018-04-10 14:19:15,188 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 143 DAG size of output 99 [2018-04-10 14:19:15,770 WARN L151 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 115 DAG size of output 88 [2018-04-10 14:19:15,969 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 150 DAG size of output 102 [2018-04-10 14:19:16,273 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 136 DAG size of output 95 [2018-04-10 14:19:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:16,508 INFO L93 Difference]: Finished difference Result 511 states and 560 transitions. [2018-04-10 14:19:16,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 14:19:16,508 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 61 [2018-04-10 14:19:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:16,509 INFO L225 Difference]: With dead ends: 511 [2018-04-10 14:19:16,509 INFO L226 Difference]: Without dead ends: 511 [2018-04-10 14:19:16,509 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=869, Invalid=4096, Unknown=5, NotChecked=0, Total=4970 [2018-04-10 14:19:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-04-10 14:19:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 446. [2018-04-10 14:19:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-10 14:19:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 496 transitions. [2018-04-10 14:19:16,512 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 496 transitions. Word has length 61 [2018-04-10 14:19:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:16,512 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 496 transitions. [2018-04-10 14:19:16,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:19:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 496 transitions. [2018-04-10 14:19:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:19:16,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:16,513 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:16,513 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash -523189878, now seen corresponding path program 1 times [2018-04-10 14:19:16,513 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:16,513 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:16,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:16,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:16,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:16,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:16,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:16,871 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:16,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:16,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:16,903 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-10 14:19:16,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:16,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,910 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-10 14:19:16,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:16,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-04-10 14:19:16,924 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 67 treesize of output 36 [2018-04-10 14:19:16,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-10 14:19:16,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:16,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:53 [2018-04-10 14:19:17,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:17,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-10 14:19:17,009 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:17,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 44 [2018-04-10 14:19:17,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:17,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:17,017 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 13 [2018-04-10 14:19:17,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-10 14:19:17,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:17,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:17,021 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-10 14:19:17,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:11 [2018-04-10 14:19:17,033 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-10 14:19:17,034 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-10 14:19:17,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:17,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:17,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:17,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-10 14:19:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-10 14:19:17,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:17,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-04-10 14:19:17,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:19:17,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:19:17,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:19:17,082 INFO L87 Difference]: Start difference. First operand 446 states and 496 transitions. Second operand 21 states. [2018-04-10 14:19:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:17,663 INFO L93 Difference]: Finished difference Result 439 states and 488 transitions. [2018-04-10 14:19:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:19:17,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-04-10 14:19:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:17,664 INFO L225 Difference]: With dead ends: 439 [2018-04-10 14:19:17,664 INFO L226 Difference]: Without dead ends: 439 [2018-04-10 14:19:17,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:19:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-10 14:19:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-04-10 14:19:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-04-10 14:19:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 488 transitions. [2018-04-10 14:19:17,668 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 488 transitions. Word has length 62 [2018-04-10 14:19:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:17,668 INFO L459 AbstractCegarLoop]: Abstraction has 439 states and 488 transitions. [2018-04-10 14:19:17,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:19:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 488 transitions. [2018-04-10 14:19:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:19:17,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:17,669 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:17,669 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash -418543436, now seen corresponding path program 1 times [2018-04-10 14:19:17,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:17,669 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:17,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:17,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:17,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:17,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:18,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:18,033 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:18,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:18,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:18,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:18,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:18,061 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-10 14:19:18,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:19:18,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:18,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:18,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:18,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:18,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,086 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-10 14:19:18,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-10 14:19:18,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:18,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 64 [2018-04-10 14:19:18,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-04-10 14:19:18,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:18,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-04-10 14:19:18,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:19:18,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:53 [2018-04-10 14:19:18,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:18,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:18,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-04-10 14:19:18,207 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:19:18,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:18,213 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 9 treesize of output 1 [2018-04-10 14:19:18,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,219 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-10 14:19:18,219 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:64, output treesize:30 [2018-04-10 14:19:18,290 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 33 treesize of output 27 [2018-04-10 14:19:18,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-10 14:19:18,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,296 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-10 14:19:18,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:18,300 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-10 14:19:18,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-04-10 14:19:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:19:18,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:18,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 30 [2018-04-10 14:19:18,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:19:18,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:19:18,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:19:18,361 INFO L87 Difference]: Start difference. First operand 439 states and 488 transitions. Second operand 31 states. [2018-04-10 14:19:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:19,275 INFO L93 Difference]: Finished difference Result 452 states and 497 transitions. [2018-04-10 14:19:19,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:19:19,275 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2018-04-10 14:19:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:19,276 INFO L225 Difference]: With dead ends: 452 [2018-04-10 14:19:19,276 INFO L226 Difference]: Without dead ends: 452 [2018-04-10 14:19:19,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=575, Invalid=2965, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 14:19:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-10 14:19:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 441. [2018-04-10 14:19:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-10 14:19:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 490 transitions. [2018-04-10 14:19:19,279 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 490 transitions. Word has length 62 [2018-04-10 14:19:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:19,280 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 490 transitions. [2018-04-10 14:19:19,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:19:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 490 transitions. [2018-04-10 14:19:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:19:19,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:19,280 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:19,280 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash 726178920, now seen corresponding path program 1 times [2018-04-10 14:19:19,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:19,280 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:19,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:19,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:19,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:19,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:20,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:20,029 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:20,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:20,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:20,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,097 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-10 14:19:20,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:19:20,124 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-10 14:19:20,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:20,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,139 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-10 14:19:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:20,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,150 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-10 14:19:20,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:19:20,173 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-10 14:19:20,174 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-10 14:19:20,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:24 [2018-04-10 14:19:20,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-10 14:19:20,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:20,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2018-04-10 14:19:20,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 14:19:20,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 14:19:20,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:40 [2018-04-10 14:19:20,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:19:20,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-04-10 14:19:20,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-04-10 14:19:20,334 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 12 [2018-04-10 14:19:20,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 14:19:20,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:19:20,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,357 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-10 14:19:20,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:47 [2018-04-10 14:19:20,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-04-10 14:19:20,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:19:20,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-04-10 14:19:20,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,435 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 3 case distinctions, treesize of input 54 treesize of output 74 [2018-04-10 14:19:20,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 56 treesize of output 41 [2018-04-10 14:19:20,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,462 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 43 treesize of output 42 [2018-04-10 14:19:20,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,488 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:60, output treesize:79 [2018-04-10 14:19:20,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 89 [2018-04-10 14:19:20,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-04-10 14:19:20,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-04-10 14:19:20,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:20,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 23 [2018-04-10 14:19:20,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:104 [2018-04-10 14:19:20,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 101 treesize of output 96 [2018-04-10 14:19:20,668 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-04-10 14:19:20,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:20,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:20,706 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 58 treesize of output 39 [2018-04-10 14:19:20,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-10 14:19:20,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:20,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:235 [2018-04-10 14:19:20,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 58 [2018-04-10 14:19:20,834 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-04-10 14:19:20,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:20,847 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 12 [2018-04-10 14:19:20,847 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,851 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2018-04-10 14:19:20,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,861 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 21 treesize of output 12 [2018-04-10 14:19:20,862 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:20,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 14:19:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-04-10 14:19:20,885 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,888 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-10 14:19:20,888 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,890 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:20,901 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:108, output treesize:38 [2018-04-10 14:19:20,959 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-10 14:19:20,962 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 14:19:20,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-04-10 14:19:20,975 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 18 [2018-04-10 14:19:20,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,981 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 13 treesize of output 10 [2018-04-10 14:19:20,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:20,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:19:20,989 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:42, output treesize:13 [2018-04-10 14:19:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:21,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:21,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-04-10 14:19:21,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:19:21,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:19:21,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1894, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:19:21,072 INFO L87 Difference]: Start difference. First operand 441 states and 490 transitions. Second operand 46 states. [2018-04-10 14:19:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:35,753 INFO L93 Difference]: Finished difference Result 617 states and 678 transitions. [2018-04-10 14:19:35,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:19:35,753 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 63 [2018-04-10 14:19:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:35,754 INFO L225 Difference]: With dead ends: 617 [2018-04-10 14:19:35,754 INFO L226 Difference]: Without dead ends: 616 [2018-04-10 14:19:35,755 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=797, Invalid=6009, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 14:19:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-10 14:19:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 432. [2018-04-10 14:19:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-10 14:19:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 480 transitions. [2018-04-10 14:19:35,758 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 480 transitions. Word has length 63 [2018-04-10 14:19:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:35,758 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 480 transitions. [2018-04-10 14:19:35,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:19:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 480 transitions. [2018-04-10 14:19:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:19:35,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:35,758 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:35,758 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1613895098, now seen corresponding path program 1 times [2018-04-10 14:19:35,759 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:35,759 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:35,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:35,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:35,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:36,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:36,264 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:36,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:36,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,296 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-10 14:19:36,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:19:36,324 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-10 14:19:36,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:36,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,335 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-10 14:19:36,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:36,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,343 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-10 14:19:36,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:19:36,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-04-10 14:19:36,419 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 18 treesize of output 20 [2018-04-10 14:19:36,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-10 14:19:36,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:19:36,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:69 [2018-04-10 14:19:36,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 6 treesize of output 5 [2018-04-10 14:19:36,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,499 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 26 treesize of output 46 [2018-04-10 14:19:36,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:94 [2018-04-10 14:19:36,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 82 [2018-04-10 14:19:36,571 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 66 [2018-04-10 14:19:36,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:36,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,604 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:36,605 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 52 treesize of output 63 [2018-04-10 14:19:36,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-04-10 14:19:36,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,625 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-10 14:19:36,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:118, output treesize:104 [2018-04-10 14:19:36,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 133 [2018-04-10 14:19:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:36,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,766 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 103 treesize of output 144 [2018-04-10 14:19:36,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:36,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:147, output treesize:151 [2018-04-10 14:19:36,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,833 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 28 treesize of output 47 [2018-04-10 14:19:36,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 85 [2018-04-10 14:19:36,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:172 [2018-04-10 14:19:36,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2018-04-10 14:19:36,918 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 140 treesize of output 118 [2018-04-10 14:19:36,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:36,963 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:36,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 145 [2018-04-10 14:19:36,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-10 14:19:36,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:36,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,007 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-10 14:19:37,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:191, output treesize:138 [2018-04-10 14:19:37,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 281 [2018-04-10 14:19:37,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-04-10 14:19:37,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 243 [2018-04-10 14:19:37,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 92 [2018-04-10 14:19:37,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,276 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-10 14:19:37,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:313, output treesize:229 [2018-04-10 14:19:37,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:37,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 177 [2018-04-10 14:19:37,426 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 57 [2018-04-10 14:19:37,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 87 treesize of output 42 [2018-04-10 14:19:37,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-04-10 14:19:37,463 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-10 14:19:37,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-10 14:19:37,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:37,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:37,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-04-10 14:19:37,502 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 11 [2018-04-10 14:19:37,502 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 14:19:37,510 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:19:37,513 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,516 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-10 14:19:37,516 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,517 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:37,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:37,523 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:256, output treesize:18 [2018-04-10 14:19:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:37,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:37,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2018-04-10 14:19:37,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 14:19:37,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 14:19:37,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1457, Unknown=3, NotChecked=0, Total=1640 [2018-04-10 14:19:37,588 INFO L87 Difference]: Start difference. First operand 432 states and 480 transitions. Second operand 41 states. [2018-04-10 14:19:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:40,130 INFO L93 Difference]: Finished difference Result 571 states and 625 transitions. [2018-04-10 14:19:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 14:19:40,131 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 65 [2018-04-10 14:19:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:40,132 INFO L225 Difference]: With dead ends: 571 [2018-04-10 14:19:40,132 INFO L226 Difference]: Without dead ends: 571 [2018-04-10 14:19:40,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=606, Invalid=4355, Unknown=9, NotChecked=0, Total=4970 [2018-04-10 14:19:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-04-10 14:19:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 429. [2018-04-10 14:19:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-04-10 14:19:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 476 transitions. [2018-04-10 14:19:40,135 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 476 transitions. Word has length 65 [2018-04-10 14:19:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:40,135 INFO L459 AbstractCegarLoop]: Abstraction has 429 states and 476 transitions. [2018-04-10 14:19:40,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 14:19:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 476 transitions. [2018-04-10 14:19:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 14:19:40,135 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:40,135 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:40,136 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1094128510, now seen corresponding path program 1 times [2018-04-10 14:19:40,136 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:40,136 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:40,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:40,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:40,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:40,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:40,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:40,579 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:40,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:40,624 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-10 14:19:40,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:40,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:40,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:40,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,636 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-10 14:19:40,656 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-10 14:19:40,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:40,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-10 14:19:40,763 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 38 treesize of output 28 [2018-04-10 14:19:40,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:19:40,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,776 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 19 treesize of output 16 [2018-04-10 14:19:40,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-10 14:19:40,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,784 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-10 14:19:40,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:9 [2018-04-10 14:19:40,818 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-10 14:19:40,835 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-10 14:19:40,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:40,836 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-10 14:19:40,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-10 14:19:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-04-10 14:19:40,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:40,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-10 14:19:40,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:19:40,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:19:40,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=468, Unknown=1, NotChecked=0, Total=552 [2018-04-10 14:19:40,875 INFO L87 Difference]: Start difference. First operand 429 states and 476 transitions. Second operand 24 states. [2018-04-10 14:19:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:41,410 INFO L93 Difference]: Finished difference Result 417 states and 462 transitions. [2018-04-10 14:19:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:19:41,410 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-04-10 14:19:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:41,411 INFO L225 Difference]: With dead ends: 417 [2018-04-10 14:19:41,411 INFO L226 Difference]: Without dead ends: 376 [2018-04-10 14:19:41,411 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=942, Unknown=4, NotChecked=0, Total=1190 [2018-04-10 14:19:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-04-10 14:19:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2018-04-10 14:19:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-10 14:19:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 420 transitions. [2018-04-10 14:19:41,413 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 420 transitions. Word has length 66 [2018-04-10 14:19:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:41,414 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 420 transitions. [2018-04-10 14:19:41,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:19:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 420 transitions. [2018-04-10 14:19:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 14:19:41,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:41,414 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:41,414 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash 526015032, now seen corresponding path program 1 times [2018-04-10 14:19:41,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:41,415 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:41,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:41,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:41,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:41,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:19:41,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:41,858 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:41,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:41,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:41,912 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 0 case distinctions, treesize of input 23 treesize of output 28 [2018-04-10 14:19:41,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-04-10 14:19:41,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:41,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:41,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:41,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:41,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,965 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-10 14:19:41,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:50 [2018-04-10 14:19:41,989 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-10 14:19:41,989 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-10 14:19:41,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:41,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:47 [2018-04-10 14:19:42,045 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 46 treesize of output 42 [2018-04-10 14:19:42,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:19:42,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2018-04-10 14:19:42,132 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 7 treesize of output 5 [2018-04-10 14:19:42,133 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-10 14:19:42,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,140 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-10 14:19:42,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:55 [2018-04-10 14:19:42,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-04-10 14:19:42,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-10 14:19:42,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,244 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 11 treesize of output 8 [2018-04-10 14:19:42,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:42,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:42,259 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 2 xjuncts. [2018-04-10 14:19:42,259 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:55 [2018-04-10 14:19:42,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,357 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-10 14:19:42,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,361 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-10 14:19:42,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-04-10 14:19:42,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,391 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-10 14:19:42,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:42,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:42,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2018-04-10 14:19:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:19:42,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:42,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-04-10 14:19:42,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:19:42,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:19:42,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1105, Unknown=3, NotChecked=0, Total=1190 [2018-04-10 14:19:42,462 INFO L87 Difference]: Start difference. First operand 376 states and 420 transitions. Second operand 35 states. [2018-04-10 14:19:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:44,056 INFO L93 Difference]: Finished difference Result 406 states and 447 transitions. [2018-04-10 14:19:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:19:44,056 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-04-10 14:19:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:44,057 INFO L225 Difference]: With dead ends: 406 [2018-04-10 14:19:44,057 INFO L226 Difference]: Without dead ends: 401 [2018-04-10 14:19:44,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=271, Invalid=3032, Unknown=3, NotChecked=0, Total=3306 [2018-04-10 14:19:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-04-10 14:19:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 376. [2018-04-10 14:19:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-10 14:19:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 419 transitions. [2018-04-10 14:19:44,059 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 419 transitions. Word has length 66 [2018-04-10 14:19:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:44,059 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 419 transitions. [2018-04-10 14:19:44,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:19:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 419 transitions. [2018-04-10 14:19:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 14:19:44,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:44,060 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:44,060 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1121699444, now seen corresponding path program 2 times [2018-04-10 14:19:44,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:44,060 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:44,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:44,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:44,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:44,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:44,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:44,528 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:44,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:19:44,552 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:19:44,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:19:44,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:44,726 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2018-04-10 14:19:44,728 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 39 [2018-04-10 14:19:44,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-10 14:19:44,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:44,750 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2018-04-10 14:19:44,751 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:44,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:44,786 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 29 treesize of output 29 [2018-04-10 14:19:44,787 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 25 treesize of output 21 [2018-04-10 14:19:44,788 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:44,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-10 14:19:44,795 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-04-10 14:19:44,805 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,810 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 33 treesize of output 25 [2018-04-10 14:19:44,811 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 21 treesize of output 17 [2018-04-10 14:19:44,811 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:44,815 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 9 [2018-04-10 14:19:44,816 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,818 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-04-10 14:19:44,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-10 14:19:44,824 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-10 14:19:44,832 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-10 14:19:44,840 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,843 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,849 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-10 14:19:44,849 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 4 variables, input treesize:64, output treesize:9 [2018-04-10 14:19:44,883 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-10 14:19:44,884 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-10 14:19:44,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:44,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-04-10 14:19:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:19:44,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:44,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 40 [2018-04-10 14:19:44,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 14:19:44,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 14:19:44,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1419, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 14:19:44,925 INFO L87 Difference]: Start difference. First operand 376 states and 419 transitions. Second operand 40 states. [2018-04-10 14:19:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:46,570 INFO L93 Difference]: Finished difference Result 417 states and 453 transitions. [2018-04-10 14:19:46,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 14:19:46,571 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 68 [2018-04-10 14:19:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:46,571 INFO L225 Difference]: With dead ends: 417 [2018-04-10 14:19:46,571 INFO L226 Difference]: Without dead ends: 383 [2018-04-10 14:19:46,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1795 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=755, Invalid=5565, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 14:19:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-10 14:19:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2018-04-10 14:19:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-10 14:19:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 389 transitions. [2018-04-10 14:19:46,574 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 389 transitions. Word has length 68 [2018-04-10 14:19:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:46,574 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 389 transitions. [2018-04-10 14:19:46,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 14:19:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 389 transitions. [2018-04-10 14:19:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 14:19:46,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:46,575 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:46,575 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -310981768, now seen corresponding path program 1 times [2018-04-10 14:19:46,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:46,575 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:46,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:46,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:19:46,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:46,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:46,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:46,806 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:46,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:46,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:46,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:46,836 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-10 14:19:46,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:19:46,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:46,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:46,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:46,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:46,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,879 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-10 14:19:46,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:19:46,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:46,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-04-10 14:19:46,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:19:46,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:46,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-04-10 14:19:46,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-10 14:19:46,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:46,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-04-10 14:19:47,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:47,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:47,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:47,046 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 20 treesize of output 21 [2018-04-10 14:19:47,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:67 [2018-04-10 14:19:47,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:47,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-04-10 14:19:47,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 14:19:47,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,110 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 52 treesize of output 58 [2018-04-10 14:19:47,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-04-10 14:19:47,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,126 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-10 14:19:47,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:69 [2018-04-10 14:19:47,215 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 130 treesize of output 105 [2018-04-10 14:19:47,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 19 [2018-04-10 14:19:47,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,237 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 113 treesize of output 109 [2018-04-10 14:19:47,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 19 [2018-04-10 14:19:47,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,253 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-10 14:19:47,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:137, output treesize:105 [2018-04-10 14:19:47,291 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 105 treesize of output 74 [2018-04-10 14:19:47,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-04-10 14:19:47,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2018-04-10 14:19:47,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:47,313 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-10 14:19:47,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,320 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-10 14:19:47,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:47,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:50 [2018-04-10 14:19:47,406 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 42 treesize of output 38 [2018-04-10 14:19:47,418 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 26 treesize of output 20 [2018-04-10 14:19:47,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:47,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-10 14:19:47,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:19:47,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:47,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:54, output treesize:3 [2018-04-10 14:19:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:47,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:47,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2018-04-10 14:19:47,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:19:47,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:19:47,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:19:47,477 INFO L87 Difference]: Start difference. First operand 348 states and 389 transitions. Second operand 33 states. [2018-04-10 14:19:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:48,800 INFO L93 Difference]: Finished difference Result 454 states and 505 transitions. [2018-04-10 14:19:48,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:19:48,800 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2018-04-10 14:19:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:48,801 INFO L225 Difference]: With dead ends: 454 [2018-04-10 14:19:48,801 INFO L226 Difference]: Without dead ends: 454 [2018-04-10 14:19:48,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=385, Invalid=2585, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 14:19:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-04-10 14:19:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 379. [2018-04-10 14:19:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-10 14:19:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 423 transitions. [2018-04-10 14:19:48,803 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 423 transitions. Word has length 68 [2018-04-10 14:19:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:48,803 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 423 transitions. [2018-04-10 14:19:48,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:19:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 423 transitions. [2018-04-10 14:19:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:19:48,804 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:48,804 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:48,804 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1050500158, now seen corresponding path program 2 times [2018-04-10 14:19:48,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:48,804 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:48,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:48,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:48,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:48,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:49,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:49,035 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:49,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:19:49,059 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:19:49,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:19:49,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:49,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,129 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-10 14:19:49,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:19:49,158 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-10 14:19:49,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:49,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,169 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-10 14:19:49,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:49,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,177 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-10 14:19:49,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:19:49,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,256 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 26 treesize of output 31 [2018-04-10 14:19:49,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-10 14:19:49,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 61 [2018-04-10 14:19:49,275 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 18 treesize of output 20 [2018-04-10 14:19:49,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:69 [2018-04-10 14:19:49,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,324 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 20 treesize of output 21 [2018-04-10 14:19:49,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:67 [2018-04-10 14:19:49,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 73 [2018-04-10 14:19:49,376 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 66 [2018-04-10 14:19:49,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:49,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,407 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 52 treesize of output 58 [2018-04-10 14:19:49,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-04-10 14:19:49,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,423 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-10 14:19:49,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:53 [2018-04-10 14:19:49,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,509 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 138 treesize of output 134 [2018-04-10 14:19:49,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-10 14:19:49,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 110 [2018-04-10 14:19:49,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-10 14:19:49,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:109 [2018-04-10 14:19:49,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,658 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 136 treesize of output 96 [2018-04-10 14:19:49,659 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 9 treesize of output 1 [2018-04-10 14:19:49,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,671 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 29 treesize of output 17 [2018-04-10 14:19:49,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,677 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 68 treesize of output 55 [2018-04-10 14:19:49,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,686 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-10 14:19:49,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:60 [2018-04-10 14:19:49,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:49,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-10 14:19:49,764 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-04-10 14:19:49,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 14:19:49,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,771 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-10 14:19:49,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:49,774 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-10 14:19:49,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:5 [2018-04-10 14:19:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:49,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:49,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-04-10 14:19:49,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 14:19:49,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 14:19:49,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:19:49,810 INFO L87 Difference]: Start difference. First operand 379 states and 423 transitions. Second operand 37 states. [2018-04-10 14:19:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:50,945 INFO L93 Difference]: Finished difference Result 465 states and 515 transitions. [2018-04-10 14:19:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 14:19:50,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2018-04-10 14:19:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:50,947 INFO L225 Difference]: With dead ends: 465 [2018-04-10 14:19:50,947 INFO L226 Difference]: Without dead ends: 465 [2018-04-10 14:19:50,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=482, Invalid=3300, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 14:19:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-04-10 14:19:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 381. [2018-04-10 14:19:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-10 14:19:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 427 transitions. [2018-04-10 14:19:50,951 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 427 transitions. Word has length 69 [2018-04-10 14:19:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:50,951 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 427 transitions. [2018-04-10 14:19:50,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 14:19:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 427 transitions. [2018-04-10 14:19:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:19:50,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:50,952 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:50,952 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1050500157, now seen corresponding path program 2 times [2018-04-10 14:19:50,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:50,952 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:50,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:50,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:19:50,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:50,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:51,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:51,466 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:51,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:19:51,506 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:19:51,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:19:51,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:51,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:51,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 14:19:51,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:19:51,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,551 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-10 14:19:51,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-10 14:19:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:51,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:51,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:19:51,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:51,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,648 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-10 14:19:51,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:53 [2018-04-10 14:19:51,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,781 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 26 treesize of output 31 [2018-04-10 14:19:51,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:19:51,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-04-10 14:19:51,805 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 18 treesize of output 20 [2018-04-10 14:19:51,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:83 [2018-04-10 14:19:51,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-04-10 14:19:51,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,886 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 20 treesize of output 21 [2018-04-10 14:19:51,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-10 14:19:51,938 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 52 treesize of output 58 [2018-04-10 14:19:51,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-04-10 14:19:51,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:51,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:51,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 82 [2018-04-10 14:19:51,983 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 66 [2018-04-10 14:19:51,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:51,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,008 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-10 14:19:52,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:80 [2018-04-10 14:19:52,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:52,110 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 155 treesize of output 151 [2018-04-10 14:19:52,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-10 14:19:52,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:52,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:52,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 132 [2018-04-10 14:19:52,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-10 14:19:52,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:172, output treesize:140 [2018-04-10 14:19:52,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:52,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:52,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 141 [2018-04-10 14:19:52,348 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 3 [2018-04-10 14:19:52,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 50 [2018-04-10 14:19:52,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:52,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-04-10 14:19:52,366 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-10 14:19:52,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:52,385 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 36 [2018-04-10 14:19:52,386 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 19 treesize of output 3 [2018-04-10 14:19:52,386 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:19:52,391 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:52,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:52,399 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:199, output treesize:31 [2018-04-10 14:19:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:52,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:52,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-04-10 14:19:52,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 14:19:52,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 14:19:52,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 14:19:52,468 INFO L87 Difference]: Start difference. First operand 381 states and 427 transitions. Second operand 36 states. [2018-04-10 14:19:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:54,303 INFO L93 Difference]: Finished difference Result 519 states and 573 transitions. [2018-04-10 14:19:54,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 14:19:54,303 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2018-04-10 14:19:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:54,304 INFO L225 Difference]: With dead ends: 519 [2018-04-10 14:19:54,304 INFO L226 Difference]: Without dead ends: 519 [2018-04-10 14:19:54,304 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 14:19:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-10 14:19:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 413. [2018-04-10 14:19:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-10 14:19:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 465 transitions. [2018-04-10 14:19:54,307 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 465 transitions. Word has length 69 [2018-04-10 14:19:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:54,307 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 465 transitions. [2018-04-10 14:19:54,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 14:19:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 465 transitions. [2018-04-10 14:19:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 14:19:54,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:54,307 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:54,308 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:19:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1946618088, now seen corresponding path program 1 times [2018-04-10 14:19:54,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:54,308 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:54,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:54,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:19:54,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:54,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:55,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:55,025 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:19:55,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:55,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:55,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,089 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-10 14:19:55,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:19:55,117 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-10 14:19:55,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:19:55,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,136 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-10 14:19:55,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:55,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,146 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-10 14:19:55,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:19:55,171 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-10 14:19:55,173 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-10 14:19:55,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-04-10 14:19:55,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,220 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 36 treesize of output 37 [2018-04-10 14:19:55,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:55,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-04-10 14:19:55,283 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 14 [2018-04-10 14:19:55,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:19:55,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:49 [2018-04-10 14:19:55,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,324 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 26 treesize of output 54 [2018-04-10 14:19:55,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:70 [2018-04-10 14:19:55,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-04-10 14:19:55,379 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 27 treesize of output 17 [2018-04-10 14:19:55,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,399 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-10 14:19:55,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:67 [2018-04-10 14:19:55,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,496 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 92 treesize of output 92 [2018-04-10 14:19:55,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:55,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:85 [2018-04-10 14:19:55,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 38 [2018-04-10 14:19:55,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17 [2018-04-10 14:19:55,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:102 [2018-04-10 14:19:55,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-04-10 14:19:55,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:99 [2018-04-10 14:19:55,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 106 [2018-04-10 14:19:55,684 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 20 treesize of output 12 [2018-04-10 14:19:55,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,708 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-10 14:19:55,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:104 [2018-04-10 14:19:55,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:55,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 134 [2018-04-10 14:19:55,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:55,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:55,942 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-10 14:19:55,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:123 [2018-04-10 14:19:55,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 108 [2018-04-10 14:19:55,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-10 14:19:55,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:56,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:56,014 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-10 14:19:56,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:178, output treesize:162 [2018-04-10 14:19:56,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 91 [2018-04-10 14:19:56,112 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-10 14:19:56,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:56,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-04-10 14:19:56,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:56,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2018-04-10 14:19:56,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:56,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-10 14:19:56,141 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:56,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:56,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:56,155 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:169, output treesize:35 [2018-04-10 14:19:58,188 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-10 14:20:06,227 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-10 14:20:06,247 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 32 treesize of output 36 [2018-04-10 14:20:06,248 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 1 [2018-04-10 14:20:06,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:20:06,255 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 13 treesize of output 10 [2018-04-10 14:20:06,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:20:06,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:20:06,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:20:06,263 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:44, output treesize:10 [2018-04-10 14:20:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:20:06,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:20:06,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 56 [2018-04-10 14:20:06,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 14:20:06,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 14:20:06,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2827, Unknown=3, NotChecked=0, Total=3080 [2018-04-10 14:20:06,340 INFO L87 Difference]: Start difference. First operand 413 states and 465 transitions. Second operand 56 states. [2018-04-10 14:20:46,085 WARN L151 SmtUtils]: Spent 4052ms on a formula simplification. DAG size of input: 96 DAG size of output 76 [2018-04-10 14:20:50,196 WARN L151 SmtUtils]: Spent 4026ms on a formula simplification. DAG size of input: 73 DAG size of output 67 [2018-04-10 14:20:54,341 WARN L151 SmtUtils]: Spent 4035ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-10 14:20:58,473 WARN L151 SmtUtils]: Spent 4033ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-04-10 14:21:02,861 WARN L151 SmtUtils]: Spent 4027ms on a formula simplification. DAG size of input: 73 DAG size of output 67 [2018-04-10 14:21:12,957 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-10 14:21:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:21:13,028 INFO L93 Difference]: Finished difference Result 772 states and 859 transitions. [2018-04-10 14:21:13,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 14:21:13,029 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 72 [2018-04-10 14:21:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:21:13,030 INFO L225 Difference]: With dead ends: 772 [2018-04-10 14:21:13,030 INFO L226 Difference]: Without dead ends: 760 [2018-04-10 14:21:13,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4728 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=1563, Invalid=12946, Unknown=11, NotChecked=0, Total=14520 [2018-04-10 14:21:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-10 14:21:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 494. [2018-04-10 14:21:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-04-10 14:21:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 561 transitions. [2018-04-10 14:21:13,034 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 561 transitions. Word has length 72 [2018-04-10 14:21:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:21:13,034 INFO L459 AbstractCegarLoop]: Abstraction has 494 states and 561 transitions. [2018-04-10 14:21:13,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 14:21:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 561 transitions. [2018-04-10 14:21:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 14:21:13,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:21:13,035 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:21:13,035 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:21:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 555440413, now seen corresponding path program 1 times [2018-04-10 14:21:13,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:21:13,035 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:21:13,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:21:13,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:21:13,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:21:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:21:13,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:21:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-04-10 14:21:13,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:21:13,178 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:21:13,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:21:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:21:13,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:21:13,261 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 26 treesize of output 22 [2018-04-10 14:21:13,262 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 22 treesize of output 14 [2018-04-10 14:21:13,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:13,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:13,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-04-10 14:21:13,267 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 23 treesize of output 14 [2018-04-10 14:21:13,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:13,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:13,271 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-10 14:21:13,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2018-04-10 14:21:13,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 20 treesize of output 16 [2018-04-10 14:21:13,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-10 14:21:13,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:13,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:13,306 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-10 14:21:13,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2018-04-10 14:21:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-04-10 14:21:13,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:21:13,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-04-10 14:21:13,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:21:13,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:21:13,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:21:13,339 INFO L87 Difference]: Start difference. First operand 494 states and 561 transitions. Second operand 22 states. [2018-04-10 14:21:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:21:13,710 INFO L93 Difference]: Finished difference Result 513 states and 575 transitions. [2018-04-10 14:21:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:21:13,710 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-04-10 14:21:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:21:13,711 INFO L225 Difference]: With dead ends: 513 [2018-04-10 14:21:13,711 INFO L226 Difference]: Without dead ends: 513 [2018-04-10 14:21:13,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:21:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-04-10 14:21:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 402. [2018-04-10 14:21:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-10 14:21:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 452 transitions. [2018-04-10 14:21:13,714 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 452 transitions. Word has length 73 [2018-04-10 14:21:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:21:13,714 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 452 transitions. [2018-04-10 14:21:13,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:21:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 452 transitions. [2018-04-10 14:21:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:21:13,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:21:13,715 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:21:13,715 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:21:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1179478759, now seen corresponding path program 3 times [2018-04-10 14:21:13,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:21:13,715 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:21:13,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:21:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:21:13,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:21:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:21:13,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:21:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:21:14,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:21:14,047 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:21:14,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:21:14,074 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:21:14,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:21:14,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:21:14,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,135 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-10 14:21:14,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:21:14,159 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-10 14:21:14,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:21:14,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,169 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-10 14:21:14,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:21:14,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,176 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-10 14:21:14,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-10 14:21:14,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:21:14,200 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-10 14:21:14,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2018-04-10 14:21:14,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-04-10 14:21:14,250 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 18 treesize of output 16 [2018-04-10 14:21:14,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2018-04-10 14:21:14,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:21:14,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-04-10 14:21:14,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 26 treesize of output 37 [2018-04-10 14:21:14,337 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2018-04-10 14:21:14,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:21:14,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 14:21:14,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:21:14,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,366 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-10 14:21:14,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:33 [2018-04-10 14:21:14,389 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 23 treesize of output 11 [2018-04-10 14:21:14,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 7 [2018-04-10 14:21:14,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2018-04-10 14:21:14,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:14,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 68 [2018-04-10 14:21:14,458 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:21:14,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 49 treesize of output 32 [2018-04-10 14:21:14,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2018-04-10 14:21:14,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:14,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:21:14,490 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:75 [2018-04-10 14:21:14,800 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 76 treesize of output 70 [2018-04-10 14:21:14,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-10 14:21:14,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,825 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 68 treesize of output 62 [2018-04-10 14:21:14,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-10 14:21:14,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:14,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:21:14,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:145, output treesize:115 [2018-04-10 14:21:15,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2018-04-10 14:21:15,029 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 36 [2018-04-10 14:21:15,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-10 14:21:15,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:21:15,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:15,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:15,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 72 [2018-04-10 14:21:15,103 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-04-10 14:21:15,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:15,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2018-04-10 14:21:15,117 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:21:15,128 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 21 treesize of output 14 [2018-04-10 14:21:15,129 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:15,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-04-10 14:21:15,130 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:15,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:15,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:15,172 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:135, output treesize:26 [2018-04-10 14:21:15,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:15,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 14:21:15,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:15,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:21:15,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-10 14:21:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:21:15,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:21:15,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2018-04-10 14:21:15,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 14:21:15,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 14:21:15,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2267, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:21:15,321 INFO L87 Difference]: Start difference. First operand 402 states and 452 transitions. Second operand 50 states. [2018-04-10 14:21:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:21:17,712 INFO L93 Difference]: Finished difference Result 470 states and 523 transitions. [2018-04-10 14:21:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:21:17,713 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2018-04-10 14:21:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:21:17,714 INFO L225 Difference]: With dead ends: 470 [2018-04-10 14:21:17,714 INFO L226 Difference]: Without dead ends: 470 [2018-04-10 14:21:17,714 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=828, Invalid=6654, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 14:21:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-10 14:21:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 456. [2018-04-10 14:21:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-04-10 14:21:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 511 transitions. [2018-04-10 14:21:17,717 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 511 transitions. Word has length 74 [2018-04-10 14:21:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:21:17,717 INFO L459 AbstractCegarLoop]: Abstraction has 456 states and 511 transitions. [2018-04-10 14:21:17,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 14:21:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 511 transitions. [2018-04-10 14:21:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:21:17,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:21:17,717 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-10 14:21:17,717 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-10 14:21:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1575581465, now seen corresponding path program 3 times [2018-04-10 14:21:17,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:21:17,717 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:21:17,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:21:17,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:21:17,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:21:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:21:17,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:21:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:21:18,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:21:18,379 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:21:18,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:21:18,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 14:21:18,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:21:18,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:21:18,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:21:18,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 14:21:18,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,445 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-10 14:21:18,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-10 14:21:18,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:21:18,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:21:18,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:21:18,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:21:18,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,474 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-10 14:21:18,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-04-10 14:21:18,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:21:18,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:21:18,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-04-10 14:21:18,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-04-10 14:21:18,536 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 18 treesize of output 16 [2018-04-10 14:21:18,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2018-04-10 14:21:18,572 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 14 [2018-04-10 14:21:18,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:21:18,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:46 [2018-04-10 14:21:18,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:21:18,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-04-10 14:21:18,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 50 [2018-04-10 14:21:18,660 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2018-04-10 14:21:18,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:21:18,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 14:21:18,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:21:18,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,693 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-10 14:21:18,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:49 [2018-04-10 14:21:18,718 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 23 treesize of output 11 [2018-04-10 14:21:18,719 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 11 treesize of output 7 [2018-04-10 14:21:18,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2018-04-10 14:21:18,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:18,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2018-04-10 14:21:18,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 49 [2018-04-10 14:21:18,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:21:18,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-04-10 14:21:18,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:18,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:18,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:55, output treesize:86 [2018-04-10 14:21:18,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:21:18,901 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 52 treesize of output 54 [2018-04-10 14:21:18,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:21:18,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-10 14:21:18,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,940 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 3 case distinctions, treesize of input 56 treesize of output 100 [2018-04-10 14:21:18,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-10 14:21:18,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:18,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:18,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:102 [2018-04-10 14:21:19,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-04-10 14:21:19,082 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 35 [2018-04-10 14:21:19,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:21:19,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 118 [2018-04-10 14:21:19,152 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 66 [2018-04-10 14:21:19,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-04-10 14:21:19,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 90 [2018-04-10 14:21:19,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15 [2018-04-10 14:21:19,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,225 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-04-10 14:21:19,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:21:19,228 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,236 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:21:19,260 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:158, output treesize:125 [2018-04-10 14:21:19,325 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 98 treesize of output 78 [2018-04-10 14:21:19,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:21:19,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,355 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 59 treesize of output 47 [2018-04-10 14:21:19,356 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 11 treesize of output 7 [2018-04-10 14:21:19,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,379 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 2 xjuncts. [2018-04-10 14:21:19,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:158, output treesize:112 [2018-04-10 14:21:19,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 87 [2018-04-10 14:21:19,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:21:19,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-04-10 14:21:19,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,682 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:21:19,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-04-10 14:21:19,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:21:19,723 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:21:19,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-10 14:21:19,724 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:21:19,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-10 14:21:19,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:19,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 139 [2018-04-10 14:21:19,841 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 14:21:19,851 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:21:20,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:21:20,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-04-10 14:21:20,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:21:20,869 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:21:20,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:21:20,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-04-10 14:21:20,871 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. Received shutdown request... [2018-04-10 14:21:21,081 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 14:21:21,082 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:21:21,084 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:21:21,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:21:21 BoogieIcfgContainer [2018-04-10 14:21:21,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:21:21,085 INFO L168 Benchmark]: Toolchain (without parser) took 184069.48 ms. Allocated memory was 397.9 MB in the beginning and 1.1 GB in the end (delta: 707.8 MB). Free memory was 333.7 MB in the beginning and 570.4 MB in the end (delta: -236.6 MB). Peak memory consumption was 694.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:21:21,086 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 397.9 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:21:21,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.65 ms. Allocated memory is still 397.9 MB. Free memory was 332.4 MB in the beginning and 306.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-10 14:21:21,086 INFO L168 Benchmark]: Boogie Preprocessor took 42.33 ms. Allocated memory is still 397.9 MB. Free memory was 306.0 MB in the beginning and 303.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-10 14:21:21,086 INFO L168 Benchmark]: RCFGBuilder took 423.62 ms. Allocated memory was 397.9 MB in the beginning and 601.4 MB in the end (delta: 203.4 MB). Free memory was 303.3 MB in the beginning and 527.5 MB in the end (delta: -224.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-04-10 14:21:21,086 INFO L168 Benchmark]: TraceAbstraction took 183359.32 ms. Allocated memory was 601.4 MB in the beginning and 1.1 GB in the end (delta: 504.4 MB). Free memory was 527.5 MB in the beginning and 570.4 MB in the end (delta: -42.9 MB). Peak memory consumption was 684.7 MB. Max. memory is 5.3 GB. [2018-04-10 14:21:21,087 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.16 ms. Allocated memory is still 397.9 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.65 ms. Allocated memory is still 397.9 MB. Free memory was 332.4 MB in the beginning and 306.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.33 ms. Allocated memory is still 397.9 MB. Free memory was 306.0 MB in the beginning and 303.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 423.62 ms. Allocated memory was 397.9 MB in the beginning and 601.4 MB in the end (delta: 203.4 MB). Free memory was 303.3 MB in the beginning and 527.5 MB in the end (delta: -224.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 183359.32 ms. Allocated memory was 601.4 MB in the beginning and 1.1 GB in the end (delta: 504.4 MB). Free memory was 527.5 MB in the beginning and 570.4 MB in the end (delta: -42.9 MB). Peak memory consumption was 684.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1016]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1016]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 108. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 107 locations, 41 error locations. TIMEOUT Result, 183.3s OverallTime, 61 OverallIterations, 4 TraceHistogramMax, 129.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4336 SDtfs, 26214 SDslu, 46409 SDs, 0 SdLazy, 51844 SolverSat, 3127 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 57.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4251 GetRequests, 1859 SyntacticMatches, 121 SemanticMatches, 2271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33095 ImplicationChecksByTransitivity, 98.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=58, 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.1s AutomataMinimizationTime, 60 MinimizatonAttempts, 3320 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 47.4s InterpolantComputationTime, 4905 NumberOfCodeBlocks, 4905 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 4803 ConstructedInterpolants, 592 QuantifiedInterpolants, 7552359 SizeOfPredicates, 590 NumberOfNonLiveVariables, 8302 ConjunctsInSsa, 1695 ConjunctsInUnsatCore, 102 InterpolantComputations, 25 PerfectInterpolantSequences, 189/1195 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-21-21-092.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-21-21-092.csv Completed graceful shutdown