java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 20:16:43,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 20:16:43,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 20:16:43,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 20:16:43,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 20:16:43,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 20:16:43,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 20:16:43,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 20:16:43,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 20:16:43,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 20:16:43,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 20:16:43,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 20:16:43,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 20:16:43,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 20:16:43,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 20:16:43,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 20:16:43,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 20:16:43,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 20:16:43,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 20:16:43,362 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 20:16:43,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 20:16:43,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 20:16:43,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 20:16:43,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 20:16:43,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 20:16:43,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 20:16:43,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 20:16:43,369 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 20:16:43,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 20:16:43,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 20:16:43,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 20:16:43,371 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 20:16:43,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 20:16:43,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 20:16:43,396 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 20:16:43,396 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 20:16:43,397 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 20:16:43,397 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 20:16:43,398 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 20:16:43,398 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 20:16:43,398 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 20:16:43,398 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 20:16:43,399 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 20:16:43,399 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 20:16:43,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 20:16:43,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 20:16:43,399 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 20:16:43,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 20:16:43,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 20:16:43,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 20:16:43,400 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 20:16:43,400 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 20:16:43,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 20:16:43,401 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 20:16:43,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 20:16:43,401 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 20:16:43,401 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 20:16:43,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 20:16:43,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 20:16:43,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 20:16:43,402 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 20:16:43,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 20:16:43,402 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 20:16:43,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 20:16:43,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:43,403 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 20:16:43,404 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 20:16:43,404 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 20:16:43,404 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 20:16:43,404 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 20:16:43,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 20:16:43,453 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 20:16:43,457 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 20:16:43,459 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 20:16:43,459 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 20:16:43,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,800 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGbdc04630f [2018-04-06 20:16:43,982 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 20:16:43,982 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 20:16:43,983 INFO L168 CDTParser]: Scanning test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,994 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 20:16:43,995 INFO L215 ultiparseSymbolTable]: [2018-04-06 20:16:43,995 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 20:16:43,995 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,995 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 20:16:43,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____suseconds_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__time_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlock_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____dev_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__mode_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int16_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__lldiv_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_short in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_set in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____caddr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutex_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__size_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_key_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__sigset_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__caddr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blksize_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____mode_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_long in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____intptr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__div_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int16_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint32_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__off_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____nlink_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_char in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____quad_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__timer_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pthread_list_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ssize_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____socklen_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrier_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_quad_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int32_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutexattr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_char in test-0504_true-valid-memsafety.i [2018-04-06 20:16:43,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__key_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sig_atomic_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int32_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fd_mask in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____id_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int32_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____gid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____timer_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_int in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__dev_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int8_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____key_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint8_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__loff_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uint in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clockid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clockid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__nlink_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_attr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__wchar_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____useconds_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_mask in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_once_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ssize_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sigset_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__quad_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int16_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_spinlock_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_cond_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__id_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__gid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ldiv_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__daddr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int8_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_short in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrierattr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__register_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ulong in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_long in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ino_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clock_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____swblk_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____WAIT_STATUS in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_quad_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ushort in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__suseconds_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____loff_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____time_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int8_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____qaddr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint16_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blksize_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsid_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clock_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____daddr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int64_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_condattr_t in test-0504_true-valid-memsafety.i [2018-04-06 20:16:44,025 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGbdc04630f [2018-04-06 20:16:44,030 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 20:16:44,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 20:16:44,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 20:16:44,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 20:16:44,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 20:16:44,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576bff7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44, skipping insertion in model container [2018-04-06 20:16:44,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,055 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:16:44,086 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:16:44,264 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:16:44,316 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:16:44,325 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-06 20:16:44,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44 WrapperNode [2018-04-06 20:16:44,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 20:16:44,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 20:16:44,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 20:16:44,378 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 20:16:44,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... [2018-04-06 20:16:44,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 20:16:44,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 20:16:44,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 20:16:44,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 20:16:44,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 20:16:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 20:16:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 20:16:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 20:16:44,577 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-06 20:16:44,577 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 20:16:44,577 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 20:16:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 20:16:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 20:16:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 20:16:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 20:16:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 20:16:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 20:16:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 20:16:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 20:16:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 20:16:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 20:16:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 20:16:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 20:16:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 20:16:44,580 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 20:16:44,580 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 20:16:44,580 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 20:16:44,580 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 20:16:44,580 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 20:16:44,580 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 20:16:44,581 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 20:16:44,581 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 20:16:44,581 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 20:16:44,581 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 20:16:44,581 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 20:16:44,581 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 20:16:44,581 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 20:16:44,582 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 20:16:44,582 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 20:16:44,582 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 20:16:44,582 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 20:16:44,582 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 20:16:44,582 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 20:16:44,582 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 20:16:44,583 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 20:16:44,584 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 20:16:44,584 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 20:16:44,584 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 20:16:44,584 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 20:16:44,584 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 20:16:44,584 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 20:16:44,584 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 20:16:44,585 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 20:16:44,586 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 20:16:44,587 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 20:16:44,587 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 20:16:44,587 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 20:16:44,587 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 20:16:44,587 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 20:16:44,587 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 20:16:44,587 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 20:16:44,588 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 20:16:44,589 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 20:16:44,590 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-06 20:16:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 20:16:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-06 20:16:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 20:16:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 20:16:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 20:16:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 20:16:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 20:16:45,045 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 20:16:45,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:16:45 BoogieIcfgContainer [2018-04-06 20:16:45,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 20:16:45,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 20:16:45,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 20:16:45,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 20:16:45,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 08:16:44" (1/3) ... [2018-04-06 20:16:45,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cc790f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:16:45, skipping insertion in model container [2018-04-06 20:16:45,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:16:44" (2/3) ... [2018-04-06 20:16:45,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cc790f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:16:45, skipping insertion in model container [2018-04-06 20:16:45,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:16:45" (3/3) ... [2018-04-06 20:16:45,052 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-04-06 20:16:45,059 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 20:16:45,066 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-04-06 20:16:45,105 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 20:16:45,105 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 20:16:45,105 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 20:16:45,105 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 20:16:45,105 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 20:16:45,105 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 20:16:45,106 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 20:16:45,106 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 20:16:45,106 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 20:16:45,106 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 20:16:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-04-06 20:16:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-06 20:16:45,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:45,128 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:45,128 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash -771866318, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:45,148 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:45,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:45,204 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-06 20:16:45,204 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:45,250 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:45,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 20:16:45,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-06 20:16:45,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-06 20:16:45,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-06 20:16:45,271 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2018-04-06 20:16:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:45,303 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2018-04-06 20:16:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-06 20:16:45,304 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-04-06 20:16:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:45,315 INFO L225 Difference]: With dead ends: 218 [2018-04-06 20:16:45,315 INFO L226 Difference]: Without dead ends: 108 [2018-04-06 20:16:45,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-06 20:16:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-06 20:16:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-06 20:16:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-06 20:16:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-04-06 20:16:45,358 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 12 [2018-04-06 20:16:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:45,358 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-04-06 20:16:45,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-06 20:16:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-04-06 20:16:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-06 20:16:45,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:45,359 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:45,359 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1515747229, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:45,365 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:45,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:45,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:16:45,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:45,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:45,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:16:45,421 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-06 20:16:45,422 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:45,430 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-06 20:16:45,452 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:45,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:16:45,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:16:45,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:16:45,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:16:45,454 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 4 states. [2018-04-06 20:16:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:45,624 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-04-06 20:16:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 20:16:45,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-06 20:16:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:45,626 INFO L225 Difference]: With dead ends: 149 [2018-04-06 20:16:45,627 INFO L226 Difference]: Without dead ends: 141 [2018-04-06 20:16:45,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-06 20:16:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-06 20:16:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2018-04-06 20:16:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-06 20:16:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-04-06 20:16:45,637 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 16 [2018-04-06 20:16:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:45,638 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-04-06 20:16:45,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:16:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-04-06 20:16:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-06 20:16:45,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:45,639 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:45,639 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1515747228, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:45,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:45,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:45,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:45,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:45,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:45,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:16:45,703 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-06 20:16:45,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:45,732 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-06 20:16:45,753 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:45,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 20:16:45,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 20:16:45,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 20:16:45,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 20:16:45,754 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 6 states. [2018-04-06 20:16:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:46,028 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-04-06 20:16:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 20:16:46,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-06 20:16:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:46,030 INFO L225 Difference]: With dead ends: 156 [2018-04-06 20:16:46,030 INFO L226 Difference]: Without dead ends: 150 [2018-04-06 20:16:46,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:16:46,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-06 20:16:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2018-04-06 20:16:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-06 20:16:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-04-06 20:16:46,040 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 16 [2018-04-06 20:16:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:46,041 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-04-06 20:16:46,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 20:16:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-04-06 20:16:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-06 20:16:46,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:46,042 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:46,043 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1601507291, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:46,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:46,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:46,072 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-06 20:16:46,073 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:46,078 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-06 20:16:46,100 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:46,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 20:16:46,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 20:16:46,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 20:16:46,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 20:16:46,101 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 3 states. [2018-04-06 20:16:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:46,240 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-04-06 20:16:46,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 20:16:46,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-06 20:16:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:46,242 INFO L225 Difference]: With dead ends: 142 [2018-04-06 20:16:46,243 INFO L226 Difference]: Without dead ends: 139 [2018-04-06 20:16:46,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-06 20:16:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-06 20:16:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 108. [2018-04-06 20:16:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-06 20:16:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-04-06 20:16:46,252 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 16 [2018-04-06 20:16:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:46,253 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-04-06 20:16:46,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 20:16:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-04-06 20:16:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-06 20:16:46,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:46,254 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:46,254 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1601506745, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:46,266 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:46,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:46,342 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-06 20:16:46,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:46,354 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-06 20:16:46,375 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:46,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:16:46,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 20:16:46,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 20:16:46,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 20:16:46,376 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 3 states. [2018-04-06 20:16:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:46,403 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2018-04-06 20:16:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 20:16:46,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-06 20:16:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:46,406 INFO L225 Difference]: With dead ends: 248 [2018-04-06 20:16:46,406 INFO L226 Difference]: Without dead ends: 151 [2018-04-06 20:16:46,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-06 20:16:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-06 20:16:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2018-04-06 20:16:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-06 20:16:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-04-06 20:16:46,414 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 16 [2018-04-06 20:16:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:46,414 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-04-06 20:16:46,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 20:16:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-04-06 20:16:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-06 20:16:46,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:46,415 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:46,415 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1401320086, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:46,422 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:46,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:46,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:46,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:46,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-06 20:16:46,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:46,488 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-06 20:16:46,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:46,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:16:46,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-06 20:16:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:46,550 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:46,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 20:16:46,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:46,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:46,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-06 20:16:46,768 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-06 20:16:46,790 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:46,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-06 20:16:46,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 20:16:46,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 20:16:46,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-06 20:16:46,791 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 8 states. [2018-04-06 20:16:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:47,127 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2018-04-06 20:16:47,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 20:16:47,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-06 20:16:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:47,129 INFO L225 Difference]: With dead ends: 256 [2018-04-06 20:16:47,129 INFO L226 Difference]: Without dead ends: 254 [2018-04-06 20:16:47,130 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-06 20:16:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-06 20:16:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 132. [2018-04-06 20:16:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-06 20:16:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2018-04-06 20:16:47,139 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 29 [2018-04-06 20:16:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:47,140 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2018-04-06 20:16:47,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 20:16:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2018-04-06 20:16:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-06 20:16:47,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:47,141 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-06 20:16:47,141 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash -491249699, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:47,147 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:47,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:47,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:47,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:16:47,172 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-06 20:16:47,173 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:47,197 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:47,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:16:47,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:16:47,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:16:47,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:16:47,198 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 4 states. [2018-04-06 20:16:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:47,283 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2018-04-06 20:16:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 20:16:47,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-06 20:16:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:47,284 INFO L225 Difference]: With dead ends: 201 [2018-04-06 20:16:47,285 INFO L226 Difference]: Without dead ends: 197 [2018-04-06 20:16:47,285 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-06 20:16:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-06 20:16:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 128. [2018-04-06 20:16:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-06 20:16:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2018-04-06 20:16:47,294 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 30 [2018-04-06 20:16:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:47,295 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2018-04-06 20:16:47,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:16:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2018-04-06 20:16:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-06 20:16:47,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:47,296 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-06 20:16:47,296 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:47,297 INFO L82 PathProgramCache]: Analyzing trace with hash -491249698, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:47,312 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:47,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:47,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:16:47,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:16:47,345 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-06 20:16:47,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:47,400 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-06 20:16:47,420 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:47,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 20:16:47,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 20:16:47,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 20:16:47,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 20:16:47,421 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand 6 states. [2018-04-06 20:16:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:47,511 INFO L93 Difference]: Finished difference Result 244 states and 264 transitions. [2018-04-06 20:16:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:16:47,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-06 20:16:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:47,512 INFO L225 Difference]: With dead ends: 244 [2018-04-06 20:16:47,512 INFO L226 Difference]: Without dead ends: 240 [2018-04-06 20:16:47,513 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:16:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-06 20:16:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 124. [2018-04-06 20:16:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-06 20:16:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-04-06 20:16:47,520 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 30 [2018-04-06 20:16:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:47,520 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-04-06 20:16:47,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 20:16:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-04-06 20:16:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-06 20:16:47,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:47,521 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:47,521 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1866164689, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:47,526 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:47,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:47,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 20:16:47,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:47,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-06 20:16:47,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:16:47,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:47,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:16:47,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-06 20:16:47,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-06 20:16:47,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-06 20:16:47,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,631 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-06 20:16:47,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-06 20:16:47,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-04-06 20:16:47,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:47,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-06 20:16:47,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,663 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-06 20:16:47,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-04-06 20:16:47,672 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-06 20:16:47,673 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:47,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-06 20:16:47,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:47,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-06 20:16:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:47,737 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:47,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2018-04-06 20:16:47,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 20:16:47,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 20:16:47,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-06 20:16:47,738 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 9 states. [2018-04-06 20:16:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:48,061 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2018-04-06 20:16:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 20:16:48,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-06 20:16:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:48,062 INFO L225 Difference]: With dead ends: 205 [2018-04-06 20:16:48,062 INFO L226 Difference]: Without dead ends: 204 [2018-04-06 20:16:48,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:16:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-06 20:16:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 145. [2018-04-06 20:16:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-06 20:16:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-04-06 20:16:48,071 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 33 [2018-04-06 20:16:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:48,072 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-04-06 20:16:48,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 20:16:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-04-06 20:16:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-06 20:16:48,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:48,073 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:48,073 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1866164688, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:48,078 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:48,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:48,104 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-06 20:16:48,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:48,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,114 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-06 20:16:48,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:48,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-06 20:16:48,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:16:48,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:48,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:16:48,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:16:48,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:48,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:16:48,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-06 20:16:48,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:48,190 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-06 20:16:48,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:48,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:48,205 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-06 20:16:48,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:54 [2018-04-06 20:16:48,327 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 32 treesize of output 33 [2018-04-06 20:16:48,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:48,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,388 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 32 treesize of output 33 [2018-04-06 20:16:48,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 20:16:48,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,409 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-06 20:16:48,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:76 [2018-04-06 20:16:48,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-04-06 20:16:48,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:48,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-06 20:16:48,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:16:48,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,488 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 35 treesize of output 29 [2018-04-06 20:16:48,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:48,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-06 20:16:48,494 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:16:48,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:16:48,528 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:90, output treesize:22 [2018-04-06 20:16:48,545 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-06 20:16:48,545 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:48,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-06 20:16:48,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 44 treesize of output 42 [2018-04-06 20:16:48,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,738 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 1 case distinctions, treesize of input 56 treesize of output 60 [2018-04-06 20:16:48,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 20:16:48,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-06 20:16:48,762 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:85, output treesize:134 [2018-04-06 20:16:48,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 39 treesize of output 37 [2018-04-06 20:16:48,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-04-06 20:16:48,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 20:16:48,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,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 18 treesize of output 16 [2018-04-06 20:16:48,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-06 20:16:48,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 6 [2018-04-06 20:16:48,870 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:48,875 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:155, output treesize:6 [2018-04-06 20:16:48,894 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-06 20:16:48,914 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:48,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2018-04-06 20:16:48,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:16:48,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:16:48,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:16:48,915 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 17 states. [2018-04-06 20:16:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:49,559 INFO L93 Difference]: Finished difference Result 264 states and 279 transitions. [2018-04-06 20:16:49,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 20:16:49,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-04-06 20:16:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:49,561 INFO L225 Difference]: With dead ends: 264 [2018-04-06 20:16:49,561 INFO L226 Difference]: Without dead ends: 263 [2018-04-06 20:16:49,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-04-06 20:16:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-06 20:16:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 145. [2018-04-06 20:16:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-06 20:16:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2018-04-06 20:16:49,569 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 33 [2018-04-06 20:16:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:49,569 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2018-04-06 20:16:49,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:16:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2018-04-06 20:16:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 20:16:49,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:49,571 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] [2018-04-06 20:16:49,571 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash -525731421, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:49,589 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:49,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:49,634 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:49,668 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:49,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2018-04-06 20:16:49,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 20:16:49,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 20:16:49,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-06 20:16:49,669 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 8 states. [2018-04-06 20:16:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:49,764 INFO L93 Difference]: Finished difference Result 247 states and 266 transitions. [2018-04-06 20:16:49,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 20:16:49,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-06 20:16:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:49,765 INFO L225 Difference]: With dead ends: 247 [2018-04-06 20:16:49,765 INFO L226 Difference]: Without dead ends: 154 [2018-04-06 20:16:49,766 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-04-06 20:16:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-06 20:16:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2018-04-06 20:16:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-06 20:16:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-04-06 20:16:49,774 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 36 [2018-04-06 20:16:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:49,774 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-04-06 20:16:49,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 20:16:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-04-06 20:16:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 20:16:49,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:49,775 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] [2018-04-06 20:16:49,775 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash -525730875, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:49,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:49,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:49,807 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:49,836 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:49,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:16:49,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:16:49,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:16:49,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:16:49,837 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 4 states. [2018-04-06 20:16:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:49,980 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2018-04-06 20:16:49,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:16:49,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-04-06 20:16:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:49,982 INFO L225 Difference]: With dead ends: 178 [2018-04-06 20:16:49,982 INFO L226 Difference]: Without dead ends: 177 [2018-04-06 20:16:49,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-06 20:16:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-06 20:16:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 149. [2018-04-06 20:16:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-06 20:16:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-04-06 20:16:49,992 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 36 [2018-04-06 20:16:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:49,993 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-04-06 20:16:49,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:16:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-04-06 20:16:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 20:16:49,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:49,994 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] [2018-04-06 20:16:49,994 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash -525730874, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:50,003 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:50,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:50,105 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:50,135 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:16:50,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:50,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:50,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2018-04-06 20:16:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:50,161 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:50,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 10 [2018-04-06 20:16:50,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 20:16:50,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 20:16:50,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-06 20:16:50,162 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 11 states. [2018-04-06 20:16:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:50,429 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-04-06 20:16:50,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 20:16:50,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-04-06 20:16:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:50,430 INFO L225 Difference]: With dead ends: 278 [2018-04-06 20:16:50,430 INFO L226 Difference]: Without dead ends: 277 [2018-04-06 20:16:50,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2018-04-06 20:16:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-06 20:16:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 179. [2018-04-06 20:16:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-06 20:16:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2018-04-06 20:16:50,439 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 36 [2018-04-06 20:16:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:50,439 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2018-04-06 20:16:50,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 20:16:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2018-04-06 20:16:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 20:16:50,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:50,441 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-06 20:16:50,441 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1697323769, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:50,446 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:50,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:50,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:50,503 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:50,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 20:16:50,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 20:16:50,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 20:16:50,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 20:16:50,504 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand 5 states. [2018-04-06 20:16:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:50,633 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-04-06 20:16:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 20:16:50,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-06 20:16:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:50,634 INFO L225 Difference]: With dead ends: 224 [2018-04-06 20:16:50,634 INFO L226 Difference]: Without dead ends: 222 [2018-04-06 20:16:50,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 20:16:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-06 20:16:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 186. [2018-04-06 20:16:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-06 20:16:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 204 transitions. [2018-04-06 20:16:50,647 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 204 transitions. Word has length 39 [2018-04-06 20:16:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:50,647 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 204 transitions. [2018-04-06 20:16:50,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 20:16:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2018-04-06 20:16:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 20:16:50,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:50,648 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-06 20:16:50,648 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1697323770, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:50,654 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:50,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:50,712 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:50,753 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:16:50,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:50,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:50,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2018-04-06 20:16:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:50,807 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:50,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2018-04-06 20:16:50,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 20:16:50,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 20:16:50,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-06 20:16:50,808 INFO L87 Difference]: Start difference. First operand 186 states and 204 transitions. Second operand 12 states. [2018-04-06 20:16:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:51,317 INFO L93 Difference]: Finished difference Result 318 states and 343 transitions. [2018-04-06 20:16:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 20:16:51,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-04-06 20:16:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:51,318 INFO L225 Difference]: With dead ends: 318 [2018-04-06 20:16:51,319 INFO L226 Difference]: Without dead ends: 316 [2018-04-06 20:16:51,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2018-04-06 20:16:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-06 20:16:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 237. [2018-04-06 20:16:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-06 20:16:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2018-04-06 20:16:51,337 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 39 [2018-04-06 20:16:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:51,338 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2018-04-06 20:16:51,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 20:16:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2018-04-06 20:16:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-06 20:16:51,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:51,339 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] [2018-04-06 20:16:51,339 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 465418529, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:51,351 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:51,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:51,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 20:16:51,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-06 20:16:51,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-06 20:16:51,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:16:51,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:51,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:16:51,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-06 20:16:51,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-06 20:16:51,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:51,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-06 20:16:51,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:51,493 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-06 20:16:51,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:5 [2018-04-06 20:16:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:51,512 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:51,606 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:51,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 14 [2018-04-06 20:16:51,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-06 20:16:51,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-06 20:16:51,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-06 20:16:51,607 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand 15 states. [2018-04-06 20:16:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:52,318 INFO L93 Difference]: Finished difference Result 337 states and 372 transitions. [2018-04-06 20:16:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 20:16:52,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-04-06 20:16:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:52,321 INFO L225 Difference]: With dead ends: 337 [2018-04-06 20:16:52,321 INFO L226 Difference]: Without dead ends: 336 [2018-04-06 20:16:52,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-04-06 20:16:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-06 20:16:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 254. [2018-04-06 20:16:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-06 20:16:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2018-04-06 20:16:52,338 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 45 [2018-04-06 20:16:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:52,339 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2018-04-06 20:16:52,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-06 20:16:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2018-04-06 20:16:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-06 20:16:52,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:52,340 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] [2018-04-06 20:16:52,340 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash 465418530, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:52,346 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:52,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:52,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 20:16:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:52,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,402 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-06 20:16:52,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:52,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-06 20:16:52,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:16:52,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:52,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:16:52,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:16:52,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:52,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:16:52,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-06 20:16:52,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-06 20:16:52,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:52,517 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 18 treesize of output 10 [2018-04-06 20:16:52,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-06 20:16:52,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:52,532 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 18 treesize of output 10 [2018-04-06 20:16:52,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:52,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:13 [2018-04-06 20:16:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:52,577 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:52,733 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:52,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 15 [2018-04-06 20:16:52,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-06 20:16:52,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-06 20:16:52,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-04-06 20:16:52,734 INFO L87 Difference]: Start difference. First operand 254 states and 287 transitions. Second operand 15 states. [2018-04-06 20:16:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:53,351 INFO L93 Difference]: Finished difference Result 371 states and 416 transitions. [2018-04-06 20:16:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 20:16:53,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-04-06 20:16:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:53,353 INFO L225 Difference]: With dead ends: 371 [2018-04-06 20:16:53,353 INFO L226 Difference]: Without dead ends: 321 [2018-04-06 20:16:53,353 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2018-04-06 20:16:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-06 20:16:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 252. [2018-04-06 20:16:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-06 20:16:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-04-06 20:16:53,372 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 45 [2018-04-06 20:16:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:53,372 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-04-06 20:16:53,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-06 20:16:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-04-06 20:16:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-06 20:16:53,373 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:53,373 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-06 20:16:53,373 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash -657946711, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:53,382 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:53,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:53,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 20:16:53,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:53,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:53,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-06 20:16:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:53,476 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:53,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:16:53,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-04-06 20:16:53,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 20:16:53,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 20:16:53,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 20:16:53,547 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 8 states. [2018-04-06 20:16:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:53,761 INFO L93 Difference]: Finished difference Result 318 states and 352 transitions. [2018-04-06 20:16:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:16:53,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-06 20:16:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:53,763 INFO L225 Difference]: With dead ends: 318 [2018-04-06 20:16:53,763 INFO L226 Difference]: Without dead ends: 317 [2018-04-06 20:16:53,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-04-06 20:16:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-06 20:16:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 251. [2018-04-06 20:16:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-04-06 20:16:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 279 transitions. [2018-04-06 20:16:53,775 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 279 transitions. Word has length 47 [2018-04-06 20:16:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:53,775 INFO L459 AbstractCegarLoop]: Abstraction has 251 states and 279 transitions. [2018-04-06 20:16:53,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 20:16:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 279 transitions. [2018-04-06 20:16:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-06 20:16:53,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:53,776 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-06 20:16:53,776 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash -657946710, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:53,795 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:53,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:53,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:53,841 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-06 20:16:53,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:53,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:53,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:53,856 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-06 20:16:53,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:53,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:53,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-06 20:16:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:53,895 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:54,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:16:54,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-04-06 20:16:54,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 20:16:54,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 20:16:54,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-06 20:16:54,098 INFO L87 Difference]: Start difference. First operand 251 states and 279 transitions. Second operand 9 states. [2018-04-06 20:16:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:54,312 INFO L93 Difference]: Finished difference Result 282 states and 311 transitions. [2018-04-06 20:16:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 20:16:54,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-04-06 20:16:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:54,314 INFO L225 Difference]: With dead ends: 282 [2018-04-06 20:16:54,314 INFO L226 Difference]: Without dead ends: 281 [2018-04-06 20:16:54,315 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-06 20:16:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-06 20:16:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 250. [2018-04-06 20:16:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-06 20:16:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2018-04-06 20:16:54,326 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 47 [2018-04-06 20:16:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:54,326 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2018-04-06 20:16:54,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 20:16:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2018-04-06 20:16:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 20:16:54,327 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:54,328 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:54,328 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash 125359813, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:54,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:54,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:54,402 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)))) is different from true [2018-04-06 20:16:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-06 20:16:54,411 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:54,464 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_8| Int)) (or (= (store |c_#valid| |v_main_#t~malloc1.base_8| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_8|))))) is different from false [2018-04-06 20:16:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-06 20:16:54,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:16:54,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-06 20:16:54,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:16:54,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:16:54,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=89, Unknown=2, NotChecked=38, Total=156 [2018-04-06 20:16:54,508 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand 13 states. [2018-04-06 20:16:54,527 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc1.base_8| Int)) (or (= (store |c_#valid| |v_main_#t~malloc1.base_8| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_8|))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 20:16:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:54,861 INFO L93 Difference]: Finished difference Result 288 states and 314 transitions. [2018-04-06 20:16:54,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 20:16:54,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-04-06 20:16:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:54,862 INFO L225 Difference]: With dead ends: 288 [2018-04-06 20:16:54,863 INFO L226 Difference]: Without dead ends: 285 [2018-04-06 20:16:54,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=228, Unknown=3, NotChecked=102, Total=420 [2018-04-06 20:16:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-06 20:16:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 255. [2018-04-06 20:16:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-06 20:16:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 280 transitions. [2018-04-06 20:16:54,874 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 280 transitions. Word has length 50 [2018-04-06 20:16:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:54,874 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 280 transitions. [2018-04-06 20:16:54,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:16:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 280 transitions. [2018-04-06 20:16:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 20:16:54,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:54,875 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] [2018-04-06 20:16:54,875 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash 125360359, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:54,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:54,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:54,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 13 treesize of output 10 [2018-04-06 20:16:54,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 10 treesize of output 9 [2018-04-06 20:16:54,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,919 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-06 20:16:54,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 10 treesize of output 9 [2018-04-06 20:16:54,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-06 20:16:54,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-06 20:16:54,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:54,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 20:16:54,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-06 20:16:54,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:54,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 20:16:54,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-06 20:16:54,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-06 20:16:54,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:54,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:54,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:54,986 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:16:54,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-04-06 20:16:54,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:54,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-06 20:16:55,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-06 20:16:55,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-06 20:16:55,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-06 20:16:55,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:16:55,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-06 20:16:55,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-06 20:16:55,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-06 20:16:55,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:81 [2018-04-06 20:16:55,174 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 44 treesize of output 34 [2018-04-06 20:16:55,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-04-06 20:16:55,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,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 50 treesize of output 38 [2018-04-06 20:16:55,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:55,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:16:55,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2018-04-06 20:16:55,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,214 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-06 20:16:55,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:10 [2018-04-06 20:16:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:55,241 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:55,305 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:16:55,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:1 [2018-04-06 20:16:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:55,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:16:55,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2018-04-06 20:16:55,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-06 20:16:55,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-06 20:16:55,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-06 20:16:55,336 INFO L87 Difference]: Start difference. First operand 255 states and 280 transitions. Second operand 14 states. [2018-04-06 20:16:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:55,836 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2018-04-06 20:16:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 20:16:55,837 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-04-06 20:16:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:55,838 INFO L225 Difference]: With dead ends: 302 [2018-04-06 20:16:55,838 INFO L226 Difference]: Without dead ends: 247 [2018-04-06 20:16:55,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2018-04-06 20:16:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-06 20:16:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2018-04-06 20:16:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-06 20:16:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-04-06 20:16:55,851 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 50 [2018-04-06 20:16:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:55,851 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-04-06 20:16:55,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-06 20:16:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-04-06 20:16:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 20:16:55,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:55,852 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-06 20:16:55,853 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash -286960237, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:55,858 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:55,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:55,890 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-06 20:16:55,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:55,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,895 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-06 20:16:55,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-06 20:16:55,899 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 16 treesize of output 15 [2018-04-06 20:16:55,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-06 20:16:55,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-06 20:16:55,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 25 [2018-04-06 20:16:55,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,960 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-06 20:16:55,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-06 20:16:55,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, 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 28 [2018-04-06 20:16:55,978 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 20 treesize of output 5 [2018-04-06 20:16:55,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:55,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:16:55,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-04-06 20:16:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:55,995 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:56,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:16:56,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-04-06 20:16:56,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:16:56,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:16:56,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:16:56,056 INFO L87 Difference]: Start difference. First operand 238 states and 262 transitions. Second operand 13 states. [2018-04-06 20:16:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:56,288 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2018-04-06 20:16:56,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 20:16:56,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-04-06 20:16:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:56,290 INFO L225 Difference]: With dead ends: 302 [2018-04-06 20:16:56,291 INFO L226 Difference]: Without dead ends: 301 [2018-04-06 20:16:56,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-04-06 20:16:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-06 20:16:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 237. [2018-04-06 20:16:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-06 20:16:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2018-04-06 20:16:56,302 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 50 [2018-04-06 20:16:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:56,303 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2018-04-06 20:16:56,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:16:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2018-04-06 20:16:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 20:16:56,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:56,303 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-06 20:16:56,303 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -286960236, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:56,313 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:56,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:56,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:56,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:16:56,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 20:16:56,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:56,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,397 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-06 20:16:56,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 20:16:56,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,411 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-06 20:16:56,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-04-06 20:16:56,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 22 [2018-04-06 20:16:56,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-04-06 20:16:56,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-06 20:16:56,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 25 [2018-04-06 20:16:56,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-06 20:16:56,515 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 26 treesize of output 26 [2018-04-06 20:16:56,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,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 29 treesize of output 28 [2018-04-06 20:16:56,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,546 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-06 20:16:56,546 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-04-06 20:16:56,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-04-06 20:16:56,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-04-06 20:16:56,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-04-06 20:16:56,583 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-04-06 20:16:56,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 29 treesize of output 22 [2018-04-06 20:16:56,601 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,616 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 25 treesize of output 9 [2018-04-06 20:16:56,616 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:56,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:16:56,628 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-04-06 20:16:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:56,645 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:57,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:16:57,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-06 20:16:57,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-06 20:16:57,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-06 20:16:57,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=282, Unknown=1, NotChecked=0, Total=342 [2018-04-06 20:16:57,110 INFO L87 Difference]: Start difference. First operand 237 states and 260 transitions. Second operand 19 states. [2018-04-06 20:16:58,073 WARN L148 SmtUtils]: Spent 295ms on a formula simplification that was a NOOP. DAG size: 24 [2018-04-06 20:16:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:58,229 INFO L93 Difference]: Finished difference Result 343 states and 377 transitions. [2018-04-06 20:16:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 20:16:58,230 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-04-06 20:16:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:58,231 INFO L225 Difference]: With dead ends: 343 [2018-04-06 20:16:58,231 INFO L226 Difference]: Without dead ends: 342 [2018-04-06 20:16:58,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=666, Unknown=2, NotChecked=0, Total=870 [2018-04-06 20:16:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-06 20:16:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 218. [2018-04-06 20:16:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-06 20:16:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 240 transitions. [2018-04-06 20:16:58,242 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 240 transitions. Word has length 50 [2018-04-06 20:16:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:58,242 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 240 transitions. [2018-04-06 20:16:58,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-06 20:16:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 240 transitions. [2018-04-06 20:16:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-06 20:16:58,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:58,243 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:58,243 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:58,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1517661726, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:58,249 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:58,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:58,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:58,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:58,305 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 14 treesize of output 23 [2018-04-06 20:16:58,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:58,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:58,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:16:58,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-06 20:16:58,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:58,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:58,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-04-06 20:16:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:58,385 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:58,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-06 20:16:58,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:58,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:58,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:12 [2018-04-06 20:16:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:58,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:16:58,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2018-04-06 20:16:58,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-06 20:16:58,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-06 20:16:58,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-04-06 20:16:58,580 INFO L87 Difference]: Start difference. First operand 218 states and 240 transitions. Second operand 15 states. [2018-04-06 20:16:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:59,128 INFO L93 Difference]: Finished difference Result 365 states and 399 transitions. [2018-04-06 20:16:59,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-06 20:16:59,129 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-04-06 20:16:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:59,130 INFO L225 Difference]: With dead ends: 365 [2018-04-06 20:16:59,130 INFO L226 Difference]: Without dead ends: 363 [2018-04-06 20:16:59,130 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2018-04-06 20:16:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-06 20:16:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 244. [2018-04-06 20:16:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-06 20:16:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 267 transitions. [2018-04-06 20:16:59,149 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 267 transitions. Word has length 53 [2018-04-06 20:16:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:59,149 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 267 transitions. [2018-04-06 20:16:59,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-06 20:16:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 267 transitions. [2018-04-06 20:16:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-06 20:16:59,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:59,151 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:59,151 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1138090745, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:59,162 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:59,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-06 20:16:59,244 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-06 20:16:59,283 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:59,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 20:16:59,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 20:16:59,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 20:16:59,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:16:59,284 INFO L87 Difference]: Start difference. First operand 244 states and 267 transitions. Second operand 7 states. [2018-04-06 20:16:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:59,385 INFO L93 Difference]: Finished difference Result 276 states and 300 transitions. [2018-04-06 20:16:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-06 20:16:59,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-04-06 20:16:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:59,386 INFO L225 Difference]: With dead ends: 276 [2018-04-06 20:16:59,386 INFO L226 Difference]: Without dead ends: 275 [2018-04-06 20:16:59,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-04-06 20:16:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-06 20:16:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 236. [2018-04-06 20:16:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-06 20:16:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 259 transitions. [2018-04-06 20:16:59,398 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 259 transitions. Word has length 61 [2018-04-06 20:16:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:59,398 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 259 transitions. [2018-04-06 20:16:59,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 20:16:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 259 transitions. [2018-04-06 20:16:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-06 20:16:59,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:59,399 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:59,399 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 921076357, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:59,410 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:16:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:16:59,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:16:59,453 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-06 20:16:59,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:16:59,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:59,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:59,459 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-06 20:16:59,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-06 20:16:59,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-06 20:16:59,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-06 20:16:59,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:16:59,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:16:59,486 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-06 20:16:59,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-06 20:16:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:59,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:16:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:16:59,534 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:16:59,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-06 20:16:59,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 20:16:59,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 20:16:59,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-06 20:16:59,535 INFO L87 Difference]: Start difference. First operand 236 states and 259 transitions. Second operand 8 states. [2018-04-06 20:16:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:16:59,975 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2018-04-06 20:16:59,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 20:16:59,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-04-06 20:16:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:16:59,977 INFO L225 Difference]: With dead ends: 282 [2018-04-06 20:16:59,977 INFO L226 Difference]: Without dead ends: 281 [2018-04-06 20:16:59,977 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-04-06 20:16:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-06 20:16:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 250. [2018-04-06 20:16:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-06 20:16:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2018-04-06 20:16:59,990 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 62 [2018-04-06 20:16:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:16:59,991 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2018-04-06 20:16:59,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 20:16:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2018-04-06 20:16:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-06 20:16:59,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:16:59,991 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:16:59,991 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:16:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash 921076358, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:16:59,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:17:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:17:00,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:17:00,090 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-06 20:17:00,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:00,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,105 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-06 20:17:00,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 20:17:00,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,117 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-06 20:17:00,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-04-06 20:17:00,157 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-06 20:17:00,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:17:00,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-06 20:17:00,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-06 20:17:00,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,180 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-06 20:17:00,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-04-06 20:17:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:17:00,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:17:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-06 20:17:00,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:00,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-04-06 20:17:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:17:00,346 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:17:00,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 8] imperfect sequences [] total 20 [2018-04-06 20:17:00,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 20:17:00,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 20:17:00,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-04-06 20:17:00,347 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand 21 states. [2018-04-06 20:17:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:17:01,536 INFO L93 Difference]: Finished difference Result 423 states and 464 transitions. [2018-04-06 20:17:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-06 20:17:01,536 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-04-06 20:17:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:17:01,538 INFO L225 Difference]: With dead ends: 423 [2018-04-06 20:17:01,538 INFO L226 Difference]: Without dead ends: 422 [2018-04-06 20:17:01,539 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=1695, Unknown=0, NotChecked=0, Total=2256 [2018-04-06 20:17:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-06 20:17:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 250. [2018-04-06 20:17:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-06 20:17:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 274 transitions. [2018-04-06 20:17:01,560 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 274 transitions. Word has length 62 [2018-04-06 20:17:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:17:01,560 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 274 transitions. [2018-04-06 20:17:01,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 20:17:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 274 transitions. [2018-04-06 20:17:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-06 20:17:01,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:17:01,561 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:17:01,561 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:17:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash -760189523, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:17:01,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:17:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:17:01,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:17:01,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-06 20:17:01,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, 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-06 20:17:01,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:01,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:01,628 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-06 20:17:01,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-04-06 20:17:01,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-06 20:17:01,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-06 20:17:01,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:01,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:01,670 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-06 20:17:01,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2018-04-06 20:17:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:17:01,705 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:17:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:17:01,816 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:17:01,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 19 [2018-04-06 20:17:01,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-06 20:17:01,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-06 20:17:01,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-04-06 20:17:01,817 INFO L87 Difference]: Start difference. First operand 250 states and 274 transitions. Second operand 20 states. [2018-04-06 20:17:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:17:02,768 INFO L93 Difference]: Finished difference Result 517 states and 555 transitions. [2018-04-06 20:17:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-06 20:17:02,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-04-06 20:17:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:17:02,769 INFO L225 Difference]: With dead ends: 517 [2018-04-06 20:17:02,770 INFO L226 Difference]: Without dead ends: 516 [2018-04-06 20:17:02,770 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=678, Invalid=1974, Unknown=0, NotChecked=0, Total=2652 [2018-04-06 20:17:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-04-06 20:17:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 291. [2018-04-06 20:17:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-06 20:17:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 322 transitions. [2018-04-06 20:17:02,788 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 322 transitions. Word has length 65 [2018-04-06 20:17:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:17:02,788 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 322 transitions. [2018-04-06 20:17:02,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-06 20:17:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 322 transitions. [2018-04-06 20:17:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 20:17:02,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:17:02,789 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-06 20:17:02,789 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:17:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1349752688, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:17:02,795 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:17:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:17:02,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:17:02,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 20:17:02,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:02,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,841 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-06 20:17:02,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:02,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-06 20:17:02,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:17:02,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:02,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:17:02,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:17:02,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:02,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:17:02,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-06 20:17:02,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:02,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:02,948 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-06 20:17:02,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:02,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-04-06 20:17:02,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-06 20:17:03,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:03,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-06 20:17:03,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:03,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2018-04-06 20:17:03,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-06 20:17:03,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 20:17:03,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-06 20:17:03,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 20:17:03,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:90 [2018-04-06 20:17:03,191 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 43 [2018-04-06 20:17:03,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,196 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:03,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-04-06 20:17:03,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,238 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 46 treesize of output 52 [2018-04-06 20:17:03,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-04-06 20:17:03,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:107 [2018-04-06 20:17:03,337 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 55 treesize of output 50 [2018-04-06 20:17:03,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,344 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:03,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-06 20:17:03,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,397 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 55 treesize of output 67 [2018-04-06 20:17:03,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,420 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-04-06 20:17:03,421 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-06 20:17:03,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:133, output treesize:131 [2018-04-06 20:17:03,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,531 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 64 treesize of output 78 [2018-04-06 20:17:03,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,565 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 8 case distinctions, treesize of input 40 treesize of output 93 [2018-04-06 20:17:03,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-04-06 20:17:03,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:17:03,707 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 70 treesize of output 67 [2018-04-06 20:17:03,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:03,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:03,712 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 23 treesize of output 35 [2018-04-06 20:17:03,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:03,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:17:03,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:444 [2018-04-06 20:17:04,033 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-04-06 20:17:04,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,050 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 305 [2018-04-06 20:17:04,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,093 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 284 [2018-04-06 20:17:04,094 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-06 20:17:04,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 20:17:04,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 327 [2018-04-06 20:17:04,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:04,732 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 306 [2018-04-06 20:17:04,735 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-06 20:17:04,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 20:17:05,465 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 364 treesize of output 315 [2018-04-06 20:17:05,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:05,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:05,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:05,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:05,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:05,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:05,472 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:05,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 263 [2018-04-06 20:17:05,478 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:05,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:06,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,052 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 309 [2018-04-06 20:17:06,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,082 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 309 [2018-04-06 20:17:06,083 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 20:17:06,179 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 20:17:06,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,765 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 322 treesize of output 299 [2018-04-06 20:17:06,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,771 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:06,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 113 treesize of output 277 [2018-04-06 20:17:06,772 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:06,810 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:06,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,817 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 331 treesize of output 308 [2018-04-06 20:17:06,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:06,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-04-06 20:17:06,825 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:06,863 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:06,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,869 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 331 treesize of output 308 [2018-04-06 20:17:06,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:06,875 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:06,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 113 treesize of output 277 [2018-04-06 20:17:06,876 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:06,915 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:07,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,342 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 302 treesize of output 289 [2018-04-06 20:17:07,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,349 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:07,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 111 treesize of output 265 [2018-04-06 20:17:07,350 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:07,390 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:07,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,396 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 303 treesize of output 290 [2018-04-06 20:17:07,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:07,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 265 [2018-04-06 20:17:07,405 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:07,444 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:07,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,450 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 299 treesize of output 278 [2018-04-06 20:17:07,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:07,457 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:07,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 111 treesize of output 265 [2018-04-06 20:17:07,459 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:07,507 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:07,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-04-06 20:17:07,871 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:1017, output treesize:2573 [2018-04-06 20:17:08,190 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 217 DAG size of output 125 [2018-04-06 20:17:08,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,355 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 327 treesize of output 282 [2018-04-06 20:17:08,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,393 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 181 treesize of output 284 [2018-04-06 20:17:08,394 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-06 20:17:08,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-04-06 20:17:08,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 241 [2018-04-06 20:17:08,569 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-06 20:17:08,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 295 [2018-04-06 20:17:08,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 20:17:08,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-06 20:17:08,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,882 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 281 treesize of output 239 [2018-04-06 20:17:08,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:08,919 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 278 [2018-04-06 20:17:08,919 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 20:17:08,939 INFO L267 ElimStorePlain]: Start of recursive call 7: 39 dim-0 vars, End of recursive call: 39 dim-0 vars, and 43 xjuncts. [2018-04-06 20:17:09,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,154 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 155 [2018-04-06 20:17:09,154 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-06 20:17:09,156 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 163 treesize of output 143 [2018-04-06 20:17:09,156 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:09,194 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:09,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,375 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 293 treesize of output 237 [2018-04-06 20:17:09,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2018-04-06 20:17:09,382 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:09,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,416 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:09,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 89 [2018-04-06 20:17:09,417 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:09,438 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:09,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,590 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 126 treesize of output 93 [2018-04-06 20:17:09,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:09,626 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 146 [2018-04-06 20:17:09,627 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-06 20:17:09,645 INFO L267 ElimStorePlain]: Start of recursive call 14: 41 dim-0 vars, End of recursive call: 41 dim-0 vars, and 45 xjuncts. [2018-04-06 20:17:09,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2018-04-06 20:17:09,878 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 20:17:09,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 31 [2018-04-06 20:17:09,880 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:17:09,904 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-06 20:17:10,070 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 177 treesize of output 139 [2018-04-06 20:17:10,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,075 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:10,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2018-04-06 20:17:10,076 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-04-06 20:17:10,101 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,118 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,121 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 203 treesize of output 159 [2018-04-06 20:17:10,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:10,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 77 [2018-04-06 20:17:10,127 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-04-06 20:17:10,156 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,175 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,177 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 205 treesize of output 161 [2018-04-06 20:17:10,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 91 [2018-04-06 20:17:10,186 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:10,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2018-04-06 20:17:10,217 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,231 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,329 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 151 treesize of output 115 [2018-04-06 20:17:10,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 101 [2018-04-06 20:17:10,335 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:10,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:10,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2018-04-06 20:17:10,355 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,362 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:10,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-06 20:17:10,446 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 10 variables, input treesize:902, output treesize:139 [2018-04-06 20:17:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:17:10,639 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:17:14,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 225 [2018-04-06 20:17:14,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:14,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 225 [2018-04-06 20:17:14,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:14,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 20:17:14,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:461, output treesize:445 [2018-04-06 20:17:15,265 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 74 [2018-04-06 20:17:17,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 308 [2018-04-06 20:17:17,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-06 20:17:17,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:17,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:17,985 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:17,986 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 108 treesize of output 105 [2018-04-06 20:17:18,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:18,008 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2018-04-06 20:17:18,011 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,011 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2018-04-06 20:17:18,014 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,014 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,015 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 71 treesize of output 87 [2018-04-06 20:17:18,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:18,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2018-04-06 20:17:18,087 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,088 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 84 [2018-04-06 20:17:18,096 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,122 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 51 treesize of output 41 [2018-04-06 20:17:18,134 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:17:18,135 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,138 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,138 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:18,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-04-06 20:17:18,141 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,148 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,159 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 240 [2018-04-06 20:17:18,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-06 20:17:18,350 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,361 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,361 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 108 treesize of output 105 [2018-04-06 20:17:18,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:18,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,386 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 80 treesize of output 74 [2018-04-06 20:17:18,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,388 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 65 treesize of output 70 [2018-04-06 20:17:18,391 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,391 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,392 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 67 treesize of output 79 [2018-04-06 20:17:18,392 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,402 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,410 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-04-06 20:17:18,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,443 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,443 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 78 [2018-04-06 20:17:18,446 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,459 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 44 treesize of output 34 [2018-04-06 20:17:18,461 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:18,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-04-06 20:17:18,462 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,467 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,470 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,473 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,481 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 147 [2018-04-06 20:17:18,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 10 [2018-04-06 20:17:18,549 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-04-06 20:17:18,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-06 20:17:18,560 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,561 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,568 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:18,584 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 9 variables, input treesize:727, output treesize:16 [2018-04-06 20:17:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:17:18,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:17:18,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-04-06 20:17:18,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-06 20:17:18,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-06 20:17:18,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1000, Unknown=1, NotChecked=0, Total=1190 [2018-04-06 20:17:18,727 INFO L87 Difference]: Start difference. First operand 291 states and 322 transitions. Second operand 35 states. [2018-04-06 20:17:20,678 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 111 DAG size of output 87 [2018-04-06 20:17:20,933 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 71 [2018-04-06 20:17:23,727 WARN L151 SmtUtils]: Spent 1547ms on a formula simplification. DAG size of input: 264 DAG size of output 181 [2018-04-06 20:17:31,022 WARN L151 SmtUtils]: Spent 4623ms on a formula simplification. DAG size of input: 375 DAG size of output 292 [2018-04-06 20:17:32,505 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 145 [2018-04-06 20:17:35,800 WARN L151 SmtUtils]: Spent 2090ms on a formula simplification. DAG size of input: 106 DAG size of output 69 [2018-04-06 20:17:36,181 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 163 DAG size of output 153 [2018-04-06 20:17:36,861 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 173 DAG size of output 162 [2018-04-06 20:17:37,177 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 163 DAG size of output 153 [2018-04-06 20:17:37,744 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 163 DAG size of output 150 [2018-04-06 20:17:38,893 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 220 DAG size of output 210 [2018-04-06 20:17:42,654 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 128 DAG size of output 73 [2018-04-06 20:17:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:17:43,544 INFO L93 Difference]: Finished difference Result 522 states and 567 transitions. [2018-04-06 20:17:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-06 20:17:43,545 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-04-06 20:17:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:17:43,547 INFO L225 Difference]: With dead ends: 522 [2018-04-06 20:17:43,548 INFO L226 Difference]: Without dead ends: 521 [2018-04-06 20:17:43,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=1029, Invalid=4976, Unknown=1, NotChecked=0, Total=6006 [2018-04-06 20:17:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-04-06 20:17:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 347. [2018-04-06 20:17:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-06 20:17:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 384 transitions. [2018-04-06 20:17:43,585 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 384 transitions. Word has length 66 [2018-04-06 20:17:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:17:43,586 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 384 transitions. [2018-04-06 20:17:43,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-06 20:17:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 384 transitions. [2018-04-06 20:17:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 20:17:43,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:17:43,587 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-06 20:17:43,587 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:17:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1349752687, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:17:43,596 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:17:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:17:43,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:17:43,650 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-06 20:17:43,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:43,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,667 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-06 20:17:43,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:43,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-06 20:17:43,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:17:43,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:43,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:17:43,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:17:43,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:43,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:17:43,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-06 20:17:43,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:43,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:43,788 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-06 20:17:43,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-04-06 20:17:43,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 30 treesize of output 31 [2018-04-06 20:17:43,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:17:43,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-04-06 20:17:43,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 20:17:43,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:79 [2018-04-06 20:17:43,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, 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 56 [2018-04-06 20:17:43,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:43,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 20:17:43,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,954 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 67 treesize of output 66 [2018-04-06 20:17:43,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:43,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 20:17:43,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:43,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:97 [2018-04-06 20:17:44,029 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 58 treesize of output 61 [2018-04-06 20:17:44,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-06 20:17:44,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,079 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 74 treesize of output 71 [2018-04-06 20:17:44,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-06 20:17:44,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:111 [2018-04-06 20:17:44,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-06 20:17:44,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-06 20:17:44,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,228 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 83 treesize of output 78 [2018-04-06 20:17:44,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-06 20:17:44,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:129 [2018-04-06 20:17:44,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2018-04-06 20:17:44,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,339 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 29 treesize of output 64 [2018-04-06 20:17:44,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,391 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 107 treesize of output 98 [2018-04-06 20:17:44,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 89 [2018-04-06 20:17:44,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:155, output treesize:153 [2018-04-06 20:17:44,493 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:44,496 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 351 treesize of output 345 [2018-04-06 20:17:44,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 320 [2018-04-06 20:17:44,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 302 [2018-04-06 20:17:44,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 115 treesize of output 333 [2018-04-06 20:17:44,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:383, output treesize:327 [2018-04-06 20:17:44,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,752 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 328 treesize of output 259 [2018-04-06 20:17:44,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,755 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 178 [2018-04-06 20:17:44,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,780 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 192 [2018-04-06 20:17:44,781 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-06 20:17:44,796 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-06 20:17:44,811 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 94 treesize of output 72 [2018-04-06 20:17:44,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,816 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:17:44,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 94 [2018-04-06 20:17:44,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:17:44,830 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 18 treesize of output 10 [2018-04-06 20:17:44,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:17:44,842 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:341, output treesize:13 [2018-04-06 20:17:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:17:44,907 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:18:03,849 WARN L148 SmtUtils]: Spent 1678ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-06 20:18:04,146 WARN L148 SmtUtils]: Spent 210ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-06 20:18:06,531 WARN L148 SmtUtils]: Spent 284ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-06 20:18:15,034 WARN L151 SmtUtils]: Spent 581ms on a formula simplification. DAG size of input: 101 DAG size of output 65 [2018-04-06 20:18:15,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 157 [2018-04-06 20:18:15,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 129 [2018-04-06 20:18:15,108 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,109 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 129 treesize of output 123 [2018-04-06 20:18:15,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,131 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-04-06 20:18:15,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,162 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:18:15,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 100 [2018-04-06 20:18:15,166 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,166 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 96 [2018-04-06 20:18:15,169 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,170 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,170 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 116 [2018-04-06 20:18:15,171 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,184 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,193 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 62 [2018-04-06 20:18:15,236 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 20:18:15,237 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,239 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,239 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,239 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,242 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,242 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,243 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 138 [2018-04-06 20:18:15,244 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,268 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 64 treesize of output 50 [2018-04-06 20:18:15,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,271 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,271 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,271 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:18:15,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 70 [2018-04-06 20:18:15,274 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,283 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,285 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,287 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 157 [2018-04-06 20:18:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 129 [2018-04-06 20:18:15,360 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2018-04-06 20:18:15,361 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,367 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,378 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-04-06 20:18:15,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 100 [2018-04-06 20:18:15,419 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,419 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,419 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 108 [2018-04-06 20:18:15,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:18:15,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 118 [2018-04-06 20:18:15,431 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,447 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 81 treesize of output 113 [2018-04-06 20:18:15,473 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,473 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,474 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,474 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 131 [2018-04-06 20:18:15,477 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,493 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,510 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:18:15,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 45 treesize of output 37 [2018-04-06 20:18:15,533 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,533 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,535 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,537 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 31 treesize of output 48 [2018-04-06 20:18:15,537 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,544 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2018-04-06 20:18:15,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 153 [2018-04-06 20:18:15,576 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,605 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 61 treesize of output 49 [2018-04-06 20:18:15,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:18:15,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 72 [2018-04-06 20:18:15,632 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,643 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,645 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:18:15,650 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:18:15,658 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:18:15,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:18:15,677 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 6 variables, input treesize:449, output treesize:37 [2018-04-06 20:18:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:18:20,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:18:20,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2018-04-06 20:18:20,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-06 20:18:20,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-06 20:18:20,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1020, Unknown=10, NotChecked=0, Total=1190 [2018-04-06 20:18:20,440 INFO L87 Difference]: Start difference. First operand 347 states and 384 transitions. Second operand 35 states. [2018-04-06 20:18:22,129 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 127 DAG size of output 72 [2018-04-06 20:18:22,353 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 155 DAG size of output 90 [2018-04-06 20:18:40,205 WARN L151 SmtUtils]: Spent 13331ms on a formula simplification. DAG size of input: 239 DAG size of output 143 [2018-04-06 20:18:59,662 WARN L151 SmtUtils]: Spent 7035ms on a formula simplification. DAG size of input: 213 DAG size of output 143 [2018-04-06 20:19:32,260 WARN L151 SmtUtils]: Spent 22422ms on a formula simplification. DAG size of input: 201 DAG size of output 150 [2018-04-06 20:19:47,729 WARN L151 SmtUtils]: Spent 8260ms on a formula simplification. DAG size of input: 280 DAG size of output 180 [2018-04-06 20:20:35,239 WARN L151 SmtUtils]: Spent 27579ms on a formula simplification. DAG size of input: 147 DAG size of output 125 [2018-04-06 20:20:40,538 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 66 DAG size of output 56 [2018-04-06 20:20:42,104 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-04-06 20:20:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:20:43,117 INFO L93 Difference]: Finished difference Result 517 states and 564 transitions. [2018-04-06 20:20:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-06 20:20:43,117 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-04-06 20:20:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:20:43,118 INFO L225 Difference]: With dead ends: 517 [2018-04-06 20:20:43,118 INFO L226 Difference]: Without dead ends: 464 [2018-04-06 20:20:43,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 139.5s TimeCoverageRelationStatistics Valid=1016, Invalid=4520, Unknown=14, NotChecked=0, Total=5550 [2018-04-06 20:20:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-06 20:20:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 345. [2018-04-06 20:20:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-06 20:20:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 380 transitions. [2018-04-06 20:20:43,142 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 380 transitions. Word has length 66 [2018-04-06 20:20:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:20:43,143 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 380 transitions. [2018-04-06 20:20:43,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-06 20:20:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 380 transitions. [2018-04-06 20:20:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 20:20:43,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:20:43,143 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:20:43,143 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:20:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2091038554, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:20:43,151 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:20:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:20:43,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:20:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-06 20:20:43,189 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:20:43,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-06 20:20:43,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-06 20:20:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-06 20:20:43,229 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:20:43,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:20:43,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:20:43,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:20:43,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:20:43,230 INFO L87 Difference]: Start difference. First operand 345 states and 380 transitions. Second operand 4 states. [2018-04-06 20:20:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:20:43,303 INFO L93 Difference]: Finished difference Result 345 states and 380 transitions. [2018-04-06 20:20:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:20:43,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-06 20:20:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:20:43,304 INFO L225 Difference]: With dead ends: 345 [2018-04-06 20:20:43,304 INFO L226 Difference]: Without dead ends: 344 [2018-04-06 20:20:43,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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-06 20:20:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-06 20:20:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2018-04-06 20:20:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-04-06 20:20:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 378 transitions. [2018-04-06 20:20:43,330 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 378 transitions. Word has length 66 [2018-04-06 20:20:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:20:43,330 INFO L459 AbstractCegarLoop]: Abstraction has 344 states and 378 transitions. [2018-04-06 20:20:43,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:20:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 378 transitions. [2018-04-06 20:20:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-06 20:20:43,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:20:43,331 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:20:43,331 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:20:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1309297633, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:20:43,337 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:20:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:20:43,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:20:43,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:43,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:43,365 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-06 20:20:43,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-06 20:20:43,372 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-06 20:20:43,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 20:20:43,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,377 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-06 20:20:43,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-04-06 20:20:43,392 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-06 20:20:43,393 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-06 20:20:43,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,395 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-06 20:20:43,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-04-06 20:20:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:43,409 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:20:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:43,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:20:43,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-04-06 20:20:43,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 20:20:43,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 20:20:43,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-04-06 20:20:43,445 INFO L87 Difference]: Start difference. First operand 344 states and 378 transitions. Second operand 11 states. [2018-04-06 20:20:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:20:43,819 INFO L93 Difference]: Finished difference Result 574 states and 623 transitions. [2018-04-06 20:20:43,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 20:20:43,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-04-06 20:20:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:20:43,822 INFO L225 Difference]: With dead ends: 574 [2018-04-06 20:20:43,822 INFO L226 Difference]: Without dead ends: 536 [2018-04-06 20:20:43,823 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-04-06 20:20:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-04-06 20:20:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 344. [2018-04-06 20:20:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-04-06 20:20:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 377 transitions. [2018-04-06 20:20:43,859 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 377 transitions. Word has length 67 [2018-04-06 20:20:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:20:43,859 INFO L459 AbstractCegarLoop]: Abstraction has 344 states and 377 transitions. [2018-04-06 20:20:43,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 20:20:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 377 transitions. [2018-04-06 20:20:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-06 20:20:43,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:20:43,860 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, 1, 1, 1] [2018-04-06 20:20:43,861 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:20:43,861 INFO L82 PathProgramCache]: Analyzing trace with hash 32076982, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:20:43,870 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:20:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:20:43,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:20:43,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:43,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:43,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 20:20:43,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:43,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-06 20:20:44,044 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-06 20:20:44,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, 2 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-06 20:20:44,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-06 20:20:44,097 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 46 treesize of output 40 [2018-04-06 20:20:44,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:20:44,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,113 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-06 20:20:44,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-04-06 20:20:44,145 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 45 treesize of output 31 [2018-04-06 20:20:44,160 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 24 treesize of output 9 [2018-04-06 20:20:44,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-06 20:20:44,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,216 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-06 20:20:44,216 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:4 [2018-04-06 20:20:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:44,248 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:20:44,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-06 20:20:44,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:20:44,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,310 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 1 case distinctions, treesize of input 24 treesize of output 28 [2018-04-06 20:20:44,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15 [2018-04-06 20:20:44,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2018-04-06 20:20:44,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-04-06 20:20:44,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:44,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:44,343 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 23 [2018-04-06 20:20:44,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-06 20:20:44,344 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2018-04-06 20:20:44,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-06 20:20:44,354 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,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 17 treesize of output 9 [2018-04-06 20:20:44,365 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:44,377 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 22 treesize of output 18 [2018-04-06 20:20:44,378 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:44,386 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:44,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-06 20:20:44,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-06 20:20:44,427 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:40, output treesize:58 [2018-04-06 20:20:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:44,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:20:44,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2018-04-06 20:20:44,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-06 20:20:44,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-06 20:20:44,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-04-06 20:20:44,951 INFO L87 Difference]: Start difference. First operand 344 states and 377 transitions. Second operand 24 states. [2018-04-06 20:20:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:20:46,211 INFO L93 Difference]: Finished difference Result 503 states and 545 transitions. [2018-04-06 20:20:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-06 20:20:46,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-04-06 20:20:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:20:46,246 INFO L225 Difference]: With dead ends: 503 [2018-04-06 20:20:46,246 INFO L226 Difference]: Without dead ends: 500 [2018-04-06 20:20:46,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2018-04-06 20:20:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-04-06 20:20:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 454. [2018-04-06 20:20:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-04-06 20:20:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 504 transitions. [2018-04-06 20:20:46,280 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 504 transitions. Word has length 71 [2018-04-06 20:20:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:20:46,281 INFO L459 AbstractCegarLoop]: Abstraction has 454 states and 504 transitions. [2018-04-06 20:20:46,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-06 20:20:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 504 transitions. [2018-04-06 20:20:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-06 20:20:46,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:20:46,281 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:20:46,281 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:20:46,282 INFO L82 PathProgramCache]: Analyzing trace with hash 32077528, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:20:46,287 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:20:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:20:46,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:20:46,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:46,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:46,345 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-06 20:20:46,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-06 20:20:46,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-06 20:20:46,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-06 20:20:46,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-06 20:20:46,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-06 20:20:46,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:20:46,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,424 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-06 20:20:46,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-06 20:20:46,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-06 20:20:46,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-06 20:20:46,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:20:46,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,480 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-06 20:20:46,480 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-04-06 20:20:46,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:46,505 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-06 20:20:46,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,509 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-06 20:20:46,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-06 20:20:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:46,536 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:20:46,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-06 20:20:46,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:20:46,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,668 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 22 treesize of output 26 [2018-04-06 20:20:46,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:20:46,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 treesize of output 9 [2018-04-06 20:20:46,678 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-06 20:20:46,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-04-06 20:20:46,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 20:20:46,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 20:20:46,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-06 20:20:46,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-06 20:20:46,700 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,703 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-04-06 20:20:46,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-06 20:20:46,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:20:46,791 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,807 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 1 case distinctions, treesize of input 24 treesize of output 28 [2018-04-06 20:20:46,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15 [2018-04-06 20:20:46,809 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 7 [2018-04-06 20:20:46,818 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:46,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:46,826 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 20 treesize of output 11 [2018-04-06 20:20:46,827 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:20:46,834 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 23 [2018-04-06 20:20:46,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 8 treesize of output 1 [2018-04-06 20:20:46,835 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,838 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2018-04-06 20:20:46,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-06 20:20:46,846 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-06 20:20:46,856 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,869 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 22 treesize of output 18 [2018-04-06 20:20:46,869 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:46,878 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:46,893 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 20:20:46,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 11 xjuncts. [2018-04-06 20:20:46,938 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:82, output treesize:110 [2018-04-06 20:20:46,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 20:20:46,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2018-04-06 20:20:46,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2018-04-06 20:20:46,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:46,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:46,995 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2018-04-06 20:20:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:47,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:20:47,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-04-06 20:20:47,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-06 20:20:47,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-06 20:20:47,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-04-06 20:20:47,152 INFO L87 Difference]: Start difference. First operand 454 states and 504 transitions. Second operand 28 states. [2018-04-06 20:20:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:20:48,389 INFO L93 Difference]: Finished difference Result 498 states and 544 transitions. [2018-04-06 20:20:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-06 20:20:48,389 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 71 [2018-04-06 20:20:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:20:48,391 INFO L225 Difference]: With dead ends: 498 [2018-04-06 20:20:48,391 INFO L226 Difference]: Without dead ends: 497 [2018-04-06 20:20:48,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=1997, Unknown=0, NotChecked=0, Total=2450 [2018-04-06 20:20:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-04-06 20:20:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 459. [2018-04-06 20:20:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-04-06 20:20:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 510 transitions. [2018-04-06 20:20:48,421 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 510 transitions. Word has length 71 [2018-04-06 20:20:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:20:48,421 INFO L459 AbstractCegarLoop]: Abstraction has 459 states and 510 transitions. [2018-04-06 20:20:48,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-06 20:20:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 510 transitions. [2018-04-06 20:20:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-06 20:20:48,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:20:48,422 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:20:48,422 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:20:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash 32077529, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:20:48,428 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:20:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:20:48,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:20:48,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:48,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:48,488 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-06 20:20:48,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-06 20:20:48,558 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-06 20:20:48,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:20:48,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,575 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-06 20:20:48,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 10 treesize of output 9 [2018-04-06 20:20:48,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,591 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-06 20:20:48,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 100 treesize of output 101 [2018-04-06 20:20:48,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-04-06 20:20:48,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-04-06 20:20:48,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 22 treesize of output 21 [2018-04-06 20:20:48,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:96 [2018-04-06 20:20:48,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2018-04-06 20:20:48,689 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 52 treesize of output 33 [2018-04-06 20:20:48,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 1 [2018-04-06 20:20:48,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,711 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 56 treesize of output 48 [2018-04-06 20:20:48,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 21 [2018-04-06 20:20:48,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-06 20:20:48,719 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,729 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-06 20:20:48,729 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:14 [2018-04-06 20:20:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:48,767 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:20:48,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-04-06 20:20:48,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:20:48,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,880 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 60 treesize of output 64 [2018-04-06 20:20:48,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 59 treesize of output 55 [2018-04-06 20:20:48,883 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-06 20:20:48,901 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 56 treesize of output 56 [2018-04-06 20:20:48,902 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-06 20:20:48,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-04-06 20:20:48,918 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-06 20:20:48,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-06 20:20:48,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-06 20:20:48,933 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,937 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:48,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-04-06 20:20:49,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-06 20:20:49,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:20:49,060 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-06 20:20:49,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 8 treesize of output 1 [2018-04-06 20:20:49,075 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,077 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,083 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 22 treesize of output 26 [2018-04-06 20:20:49,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-06 20:20:49,085 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-04-06 20:20:49,097 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:49,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2018-04-06 20:20:49,104 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,107 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:49,117 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-06 20:20:49,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-04-06 20:20:49,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:20:49,207 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,222 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 24 treesize of output 28 [2018-04-06 20:20:49,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 19 [2018-04-06 20:20:49,224 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2018-04-06 20:20:49,232 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,242 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 20 treesize of output 20 [2018-04-06 20:20:49,243 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:49,247 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:49,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-06 20:20:49,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-06 20:20:49,250 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,251 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,261 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-06 20:20:49,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-06 20:20:49,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:20:49,277 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,286 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 1 case distinctions, treesize of input 24 treesize of output 28 [2018-04-06 20:20:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-06 20:20:49,288 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,300 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 20 treesize of output 20 [2018-04-06 20:20:49,300 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:49,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 12 treesize of output 3 [2018-04-06 20:20:49,307 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,311 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:49,316 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:49,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-04-06 20:20:49,364 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 3 variables, input treesize:121, output treesize:135 [2018-04-06 20:20:49,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 treesize of output 18 [2018-04-06 20:20:49,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 treesize of output 18 [2018-04-06 20:20:49,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 33 [2018-04-06 20:20:49,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:49,733 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 19 treesize of output 17 [2018-04-06 20:20:49,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-06 20:20:49,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-04-06 20:20:49,852 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:49,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 20:20:49,876 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:180, output treesize:57 [2018-04-06 20:20:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:50,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:20:50,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2018-04-06 20:20:50,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-06 20:20:50,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-06 20:20:50,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-04-06 20:20:50,408 INFO L87 Difference]: Start difference. First operand 459 states and 510 transitions. Second operand 27 states. [2018-04-06 20:20:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:20:52,004 INFO L93 Difference]: Finished difference Result 555 states and 605 transitions. [2018-04-06 20:20:52,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-06 20:20:52,004 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-04-06 20:20:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:20:52,006 INFO L225 Difference]: With dead ends: 555 [2018-04-06 20:20:52,006 INFO L226 Difference]: Without dead ends: 554 [2018-04-06 20:20:52,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=440, Invalid=1912, Unknown=0, NotChecked=0, Total=2352 [2018-04-06 20:20:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-04-06 20:20:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 513. [2018-04-06 20:20:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-06 20:20:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 566 transitions. [2018-04-06 20:20:52,040 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 566 transitions. Word has length 71 [2018-04-06 20:20:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:20:52,040 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 566 transitions. [2018-04-06 20:20:52,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-06 20:20:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 566 transitions. [2018-04-06 20:20:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-06 20:20:52,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:20:52,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:20:52,041 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:20:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 287922260, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:20:52,048 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:20:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:20:52,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:20:52,101 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-06 20:20:52,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:20:52,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,108 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-06 20:20:52,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-04-06 20:20:52,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-06 20:20:52,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-06 20:20:52,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-06 20:20:52,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:52,205 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-06 20:20:52,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,209 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-06 20:20:52,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-06 20:20:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:52,235 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:20:52,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-06 20:20:52,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:52,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-04-06 20:20:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:52,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:20:52,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2018-04-06 20:20:52,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-06 20:20:52,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-06 20:20:52,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-04-06 20:20:52,398 INFO L87 Difference]: Start difference. First operand 513 states and 566 transitions. Second operand 25 states. [2018-04-06 20:20:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:20:53,871 INFO L93 Difference]: Finished difference Result 774 states and 858 transitions. [2018-04-06 20:20:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-06 20:20:53,872 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2018-04-06 20:20:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:20:53,874 INFO L225 Difference]: With dead ends: 774 [2018-04-06 20:20:53,874 INFO L226 Difference]: Without dead ends: 773 [2018-04-06 20:20:53,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1004, Invalid=3286, Unknown=0, NotChecked=0, Total=4290 [2018-04-06 20:20:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-06 20:20:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 521. [2018-04-06 20:20:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-06 20:20:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 575 transitions. [2018-04-06 20:20:53,910 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 575 transitions. Word has length 71 [2018-04-06 20:20:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:20:53,910 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 575 transitions. [2018-04-06 20:20:53,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-06 20:20:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 575 transitions. [2018-04-06 20:20:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-06 20:20:53,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:20:53,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:20:53,911 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-06 20:20:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 287923703, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:20:53,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:20:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:20:53,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:20:53,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 20:20:53,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:20:53,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:53,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:53,971 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-06 20:20:53,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 20:20:53,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:53,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:53,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:53,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-06 20:20:53,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:20:53,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:53,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:20:53,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:53,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 20:20:54,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:20:54,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-06 20:20:54,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-06 20:20:54,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 32 [2018-04-06 20:20:54,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-06 20:20:54,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,144 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:54,144 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 26 treesize of output 35 [2018-04-06 20:20:54,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 28 [2018-04-06 20:20:54,164 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,185 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-06 20:20:54,244 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:54,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 66 [2018-04-06 20:20:54,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:54,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 67 [2018-04-06 20:20:54,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,293 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:54,294 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 36 treesize of output 62 [2018-04-06 20:20:54,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,325 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:54,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 87 [2018-04-06 20:20:54,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,360 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 4 case distinctions, treesize of input 84 treesize of output 114 [2018-04-06 20:20:54,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-06 20:20:54,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:20:54,486 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 3 xjuncts. [2018-04-06 20:20:54,486 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:109, output treesize:264 [2018-04-06 20:20:54,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 103 [2018-04-06 20:20:54,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,571 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 98 treesize of output 111 [2018-04-06 20:20:54,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:20:54,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 113 [2018-04-06 20:20:54,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,778 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 112 treesize of output 141 [2018-04-06 20:20:54,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 103 [2018-04-06 20:20:54,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:54,930 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 98 treesize of output 111 [2018-04-06 20:20:54,930 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:54,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 101 [2018-04-06 20:20:55,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:55,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 111 [2018-04-06 20:20:55,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,095 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 123 [2018-04-06 20:20:55,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:55,193 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 120 treesize of output 137 [2018-04-06 20:20:55,194 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,229 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 133 [2018-04-06 20:20:55,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:55,314 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 138 treesize of output 167 [2018-04-06 20:20:55,314 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,368 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:20:55,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-06 20:20:55,439 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:342, output treesize:366 [2018-04-06 20:20:55,524 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:55,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 120 [2018-04-06 20:20:55,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:55,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:55,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 130 [2018-04-06 20:20:55,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:20:55,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:55,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 137 [2018-04-06 20:20:55,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:55,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 76 [2018-04-06 20:20:55,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:55,965 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:55,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 208 treesize of output 163 [2018-04-06 20:20:55,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:55,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 97 [2018-04-06 20:20:55,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:56,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:56,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 124 [2018-04-06 20:20:56,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:56,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:56,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 183 [2018-04-06 20:20:56,125 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:56,165 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 20:20:56,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 138 [2018-04-06 20:20:56,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:56,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 138 [2018-04-06 20:20:56,309 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:56,360 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:20:56,487 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:56,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 113 [2018-04-06 20:20:56,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:56,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-04-06 20:20:56,500 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:56,531 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:56,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-04-06 20:20:56,636 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:498, output treesize:582 [2018-04-06 20:20:57,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,079 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 131 [2018-04-06 20:20:57,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,135 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 82 [2018-04-06 20:20:57,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-06 20:20:57,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 106 [2018-04-06 20:20:57,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:57,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,208 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 104 [2018-04-06 20:20:57,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:57,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,221 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-04-06 20:20:57,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,225 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 104 [2018-04-06 20:20:57,232 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-06 20:20:57,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-06 20:20:57,425 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 67 treesize of output 57 [2018-04-06 20:20:57,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-06 20:20:57,428 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 20:20:57,441 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,448 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,451 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 67 treesize of output 57 [2018-04-06 20:20:57,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-06 20:20:57,453 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-06 20:20:57,466 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,476 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 67 treesize of output 53 [2018-04-06 20:20:57,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-06 20:20:57,479 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 20:20:57,494 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,501 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,504 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 67 treesize of output 53 [2018-04-06 20:20:57,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-06 20:20:57,506 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 20:20:57,519 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,527 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,590 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,591 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 137 treesize of output 126 [2018-04-06 20:20:57,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:20:57,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,601 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 84 [2018-04-06 20:20:57,602 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-06 20:20:57,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-04-06 20:20:57,634 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,650 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,698 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 63 treesize of output 51 [2018-04-06 20:20:57,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-06 20:20:57,700 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:20:57,712 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 18 treesize of output 10 [2018-04-06 20:20:57,712 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,719 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:20:57,757 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 7 variables, input treesize:304, output treesize:13 [2018-04-06 20:20:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:20:57,842 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:20:58,381 WARN L148 SmtUtils]: Spent 264ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-06 20:21:01,635 WARN L148 SmtUtils]: Spent 3159ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-06 20:21:02,629 WARN L148 SmtUtils]: Spent 413ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-06 20:21:04,742 WARN L148 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-06 20:21:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:21:04,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:21:04,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2018-04-06 20:21:04,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-06 20:21:04,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-06 20:21:04,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1044, Unknown=1, NotChecked=0, Total=1190 [2018-04-06 20:21:04,815 INFO L87 Difference]: Start difference. First operand 521 states and 575 transitions. Second operand 35 states. Received shutdown request... [2018-04-06 20:21:09,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-06 20:21:09,378 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 20:21:09,382 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 20:21:09,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 08:21:09 BoogieIcfgContainer [2018-04-06 20:21:09,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 20:21:09,383 INFO L168 Benchmark]: Toolchain (without parser) took 265351.89 ms. Allocated memory was 307.2 MB in the beginning and 622.9 MB in the end (delta: 315.6 MB). Free memory was 244.6 MB in the beginning and 527.8 MB in the end (delta: -283.2 MB). Peak memory consumption was 32.5 MB. Max. memory is 5.3 GB. [2018-04-06 20:21:09,384 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 307.2 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 20:21:09,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.00 ms. Allocated memory is still 307.2 MB. Free memory was 244.6 MB in the beginning and 219.7 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-06 20:21:09,385 INFO L168 Benchmark]: Boogie Preprocessor took 67.58 ms. Allocated memory is still 307.2 MB. Free memory was 219.7 MB in the beginning and 216.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 20:21:09,385 INFO L168 Benchmark]: RCFGBuilder took 599.39 ms. Allocated memory was 307.2 MB in the beginning and 472.4 MB in the end (delta: 165.2 MB). Free memory was 216.7 MB in the beginning and 399.6 MB in the end (delta: -182.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. [2018-04-06 20:21:09,385 INFO L168 Benchmark]: TraceAbstraction took 264336.09 ms. Allocated memory was 472.4 MB in the beginning and 622.9 MB in the end (delta: 150.5 MB). Free memory was 399.6 MB in the beginning and 527.8 MB in the end (delta: -128.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-04-06 20:21:09,386 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 307.2 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 345.00 ms. Allocated memory is still 307.2 MB. Free memory was 244.6 MB in the beginning and 219.7 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 67.58 ms. Allocated memory is still 307.2 MB. Free memory was 219.7 MB in the beginning and 216.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 599.39 ms. Allocated memory was 307.2 MB in the beginning and 472.4 MB in the end (delta: 165.2 MB). Free memory was 216.7 MB in the beginning and 399.6 MB in the end (delta: -182.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 264336.09 ms. Allocated memory was 472.4 MB in the beginning and 622.9 MB in the end (delta: 150.5 MB). Free memory was 399.6 MB in the beginning and 527.8 MB in the end (delta: -128.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (521states) and interpolant automaton (currently 13 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 39 error locations. TIMEOUT Result, 264.2s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 188.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3202 SDtfs, 16156 SDslu, 17020 SDs, 0 SdLazy, 13935 SolverSat, 1278 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 56.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3921 GetRequests, 3024 SyntacticMatches, 39 SemanticMatches, 857 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 7366 ImplicationChecksByTransitivity, 184.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 2792 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 72.9s InterpolantComputationTime, 1724 NumberOfCodeBlocks, 1724 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3374 ConstructedInterpolants, 269 QuantifiedInterpolants, 4705536 SizeOfPredicates, 345 NumberOfNonLiveVariables, 6017 ConjunctsInSsa, 637 ConjunctsInUnsatCore, 74 InterpolantComputations, 44 PerfectInterpolantSequences, 361/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_20-21-09-393.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_20-21-09-393.csv Completed graceful shutdown