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/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-8168ed2-m
[2018-04-11 20:35:27,383 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-04-11 20:35:27,384 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-04-11 20:35:27,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-04-11 20:35:27,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-04-11 20:35:27,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-04-11 20:35:27,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-04-11 20:35:27,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-04-11 20:35:27,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-04-11 20:35:27,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-04-11 20:35:27,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-04-11 20:35:27,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-04-11 20:35:27,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-04-11 20:35:27,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-04-11 20:35:27,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-04-11 20:35:27,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-04-11 20:35:27,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-04-11 20:35:27,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-04-11 20:35:27,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-04-11 20:35:27,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-04-11 20:35:27,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-04-11 20:35:27,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-04-11 20:35:27,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-04-11 20:35:27,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-04-11 20:35:27,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-04-11 20:35:27,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-04-11 20:35:27,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-04-11 20:35:27,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-04-11 20:35:27,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-04-11 20:35:27,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-04-11 20:35:27,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-04-11 20:35:27,426 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf
[2018-04-11 20:35:27,448 INFO L110 SettingsManager]: Loading preferences was successful
[2018-04-11 20:35:27,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-04-11 20:35:27,449 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2018-04-11 20:35:27,449 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG;
[2018-04-11 20:35:27,450 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-04-11 20:35:27,450 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-04-11 20:35:27,450 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-04-11 20:35:27,450 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-04-11 20:35:27,450 INFO L133 SettingsManager]: * Parallel states before merging=1
[2018-04-11 20:35:27,450 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-04-11 20:35:27,451 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults:
[2018-04-11 20:35:27,451 INFO L133 SettingsManager]: * Property to check=[] a
a: x > 42
[2018-04-11 20:35:27,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-04-11 20:35:27,451 INFO L133 SettingsManager]: * sizeof long=4
[2018-04-11 20:35:27,451 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-04-11 20:35:27,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-04-11 20:35:27,452 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-04-11 20:35:27,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-04-11 20:35:27,452 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-04-11 20:35:27,452 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-04-11 20:35:27,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-04-11 20:35:27,452 INFO L133 SettingsManager]: * sizeof long double=12
[2018-04-11 20:35:27,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-04-11 20:35:27,453 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-04-11 20:35:27,453 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-04-11 20:35:27,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-04-11 20:35:27,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-04-11 20:35:27,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-04-11 20:35:27,454 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-04-11 20:35:27,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-04-11 20:35:27,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-04-11 20:35:27,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-04-11 20:35:27,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:27,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-04-11 20:35:27,455 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-04-11 20:35:27,456 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-04-11 20:35:27,456 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults:
[2018-04-11 20:35:27,456 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\
[2018-04-11 20:35:27,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-04-11 20:35:27,498 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized
[2018-04-11 20:35:27,501 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-04-11 20:35:27,503 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-04-11 20:35:27,503 INFO L276 PluginConnector]: CDTParser initialized
[2018-04-11 20:35:27,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,830 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1cc565648
[2018-04-11 20:35:27,981 INFO L287 CDTParser]: IsIndexed: true
[2018-04-11 20:35:27,981 INFO L288 CDTParser]: Found 1 translation units.
[2018-04-11 20:35:27,982 INFO L168 CDTParser]: Scanning openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,993 INFO L210 ultiparseSymbolTable]: Include resolver:
[2018-04-11 20:35:27,993 INFO L215 ultiparseSymbolTable]: <empty include resolver>
[2018-04-11 20:35:27,994 INFO L218 ultiparseSymbolTable]: Function table:
[2018-04-11 20:35:27,994 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat ('cstrcat') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,994 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,994 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,994 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,994 INFO L227 ultiparseSymbolTable]: Global variable table:
[2018-04-11 20:35:27,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:27,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,025 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1cc565648
[2018-04-11 20:35:28,030 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-04-11 20:35:28,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-04-11 20:35:28,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-04-11 20:35:28,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-04-11 20:35:28,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-04-11 20:35:28,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7338a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28, skipping insertion in model container
[2018-04-11 20:35:28,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,061 INFO L167 Dispatcher]: Using SV-COMP mode
[2018-04-11 20:35:28,092 INFO L167 Dispatcher]: Using SV-COMP mode
[2018-04-11 20:35:28,253 INFO L175 PostProcessor]: Settings: Checked method=main
[2018-04-11 20:35:28,300 INFO L175 PostProcessor]: Settings: Checked method=main
[2018-04-11 20:35:28,306 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112.
[2018-04-11 20:35:28,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28 WrapperNode
[2018-04-11 20:35:28,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-04-11 20:35:28,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-04-11 20:35:28,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-04-11 20:35:28,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-04-11 20:35:28,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
[2018-04-11 20:35:28,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-04-11 20:35:28,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-04-11 20:35:28,414 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-04-11 20:35:28,414 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-04-11 20:35:28,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-04-11 20:35:28,556 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-04-11 20:35:28,556 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-04-11 20:35:28,556 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32
[2018-04-11 20:35:28,556 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64
[2018-04-11 20:35:28,556 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat
[2018-04-11 20:35:28,556 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-04-11 20:35:28,556 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32
[2018-04-11 20:35:28,556 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure atof
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure atoi
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure atol
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure atoll
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure strtod
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure strtof
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure strtold
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure strtol
[2018-04-11 20:35:28,557 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure l64a
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure a64l
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure select
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure pselect
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major
[2018-04-11 20:35:28,558 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor
[2018-04-11 20:35:28,559 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev
[2018-04-11 20:35:28,559 INFO L128 BoogieDeclarations]: Found specification of procedure random
[2018-04-11 20:35:28,559 INFO L128 BoogieDeclarations]: Found specification of procedure srandom
[2018-04-11 20:35:28,559 INFO L128 BoogieDeclarations]: Found specification of procedure initstate
[2018-04-11 20:35:28,559 INFO L128 BoogieDeclarations]: Found specification of procedure setstate
[2018-04-11 20:35:28,559 INFO L128 BoogieDeclarations]: Found specification of procedure random_r
[2018-04-11 20:35:28,559 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r
[2018-04-11 20:35:28,560 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r
[2018-04-11 20:35:28,560 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r
[2018-04-11 20:35:28,560 INFO L128 BoogieDeclarations]: Found specification of procedure rand
[2018-04-11 20:35:28,560 INFO L128 BoogieDeclarations]: Found specification of procedure srand
[2018-04-11 20:35:28,560 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r
[2018-04-11 20:35:28,560 INFO L128 BoogieDeclarations]: Found specification of procedure drand48
[2018-04-11 20:35:28,560 INFO L128 BoogieDeclarations]: Found specification of procedure erand48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure srand48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure seed48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48
[2018-04-11 20:35:28,561 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r
[2018-04-11 20:35:28,562 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r
[2018-04-11 20:35:28,562 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r
[2018-04-11 20:35:28,562 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r
[2018-04-11 20:35:28,562 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r
[2018-04-11 20:35:28,562 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r
[2018-04-11 20:35:28,562 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r
[2018-04-11 20:35:28,562 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure calloc
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure realloc
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure cfree
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure alloca
[2018-04-11 20:35:28,563 INFO L128 BoogieDeclarations]: Found specification of procedure valloc
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure abort
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure atexit
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure exit
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure getenv
[2018-04-11 20:35:28,564 INFO L128 BoogieDeclarations]: Found specification of procedure putenv
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure setenv
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp
[2018-04-11 20:35:28,565 INFO L128 BoogieDeclarations]: Found specification of procedure system
[2018-04-11 20:35:28,566 INFO L128 BoogieDeclarations]: Found specification of procedure realpath
[2018-04-11 20:35:28,566 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch
[2018-04-11 20:35:28,566 INFO L128 BoogieDeclarations]: Found specification of procedure qsort
[2018-04-11 20:35:28,566 INFO L128 BoogieDeclarations]: Found specification of procedure abs
[2018-04-11 20:35:28,566 INFO L128 BoogieDeclarations]: Found specification of procedure labs
[2018-04-11 20:35:28,566 INFO L128 BoogieDeclarations]: Found specification of procedure llabs
[2018-04-11 20:35:28,566 INFO L128 BoogieDeclarations]: Found specification of procedure div
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt
[2018-04-11 20:35:28,567 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure mblen
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb
[2018-04-11 20:35:28,568 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs
[2018-04-11 20:35:28,569 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs
[2018-04-11 20:35:28,569 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch
[2018-04-11 20:35:28,569 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt
[2018-04-11 20:35:28,569 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg
[2018-04-11 20:35:28,569 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-04-11 20:35:28,569 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat
[2018-04-11 20:35:28,569 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-04-11 20:35:28,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-04-11 20:35:28,570 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-04-11 20:35:28,570 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-04-11 20:35:28,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-04-11 20:35:28,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-04-11 20:35:28,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-04-11 20:35:28,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2018-04-11 20:35:28,972 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-04-11 20:35:28,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:35:28 BoogieIcfgContainer
[2018-04-11 20:35:28,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-04-11 20:35:28,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-04-11 20:35:28,974 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-04-11 20:35:28,976 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-04-11 20:35:28,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 08:35:28" (1/3) ...
[2018-04-11 20:35:28,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144645fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:35:28, skipping insertion in model container
[2018-04-11 20:35:28,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:35:28" (2/3) ...
[2018-04-11 20:35:28,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144645fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:35:28, skipping insertion in model container
[2018-04-11 20:35:28,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:35:28" (3/3) ...
[2018-04-11 20:35:28,978 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-04-11 20:35:28,985 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-04-11 20:35:28,991 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations.
[2018-04-11 20:35:29,026 INFO L128 ementStrategyFactory]: Using default assertion order modulation
[2018-04-11 20:35:29,027 INFO L369 AbstractCegarLoop]: Interprodecural is true
[2018-04-11 20:35:29,027 INFO L370 AbstractCegarLoop]: Hoare is true
[2018-04-11 20:35:29,027 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-04-11 20:35:29,027 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-04-11 20:35:29,027 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-04-11 20:35:29,027 INFO L374 AbstractCegarLoop]: Difference is false
[2018-04-11 20:35:29,027 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-04-11 20:35:29,027 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-04-11 20:35:29,028 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-04-11 20:35:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states.
[2018-04-11 20:35:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-04-11 20:35:29,045 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:29,046 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:29,046 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash 703701311, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:29,062 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:29,095 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:29,124 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:29,174 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:29,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2
[2018-04-11 20:35:29,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-04-11 20:35:29,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-04-11 20:35:29,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-04-11 20:35:29,193 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states.
[2018-04-11 20:35:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:29,279 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions.
[2018-04-11 20:35:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-04-11 20:35:29,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21
[2018-04-11 20:35:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:29,295 INFO L225 Difference]: With dead ends: 112
[2018-04-11 20:35:29,295 INFO L226 Difference]: Without dead ends: 75
[2018-04-11 20:35:29,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-04-11 20:35:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2018-04-11 20:35:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2018-04-11 20:35:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2018-04-11 20:35:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions.
[2018-04-11 20:35:29,343 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21
[2018-04-11 20:35:29,344 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:29,344 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions.
[2018-04-11 20:35:29,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-04-11 20:35:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions.
[2018-04-11 20:35:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-04-11 20:35:29,345 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:29,345 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:29,345 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:29,346 INFO L82 PathProgramCache]: Analyzing trace with hash 289022876, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:29,353 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:29,370 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:29,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:29,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-04-11 20:35:29,424 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-11 20:35:29,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:29,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11
[2018-04-11 20:35:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:29,444 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:29,486 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:29,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3
[2018-04-11 20:35:29,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-04-11 20:35:29,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-04-11 20:35:29,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-04-11 20:35:29,489 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states.
[2018-04-11 20:35:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:29,574 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions.
[2018-04-11 20:35:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-04-11 20:35:29,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24
[2018-04-11 20:35:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:29,576 INFO L225 Difference]: With dead ends: 75
[2018-04-11 20:35:29,576 INFO L226 Difference]: Without dead ends: 74
[2018-04-11 20:35:29,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-04-11 20:35:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2018-04-11 20:35:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2018-04-11 20:35:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2018-04-11 20:35:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions.
[2018-04-11 20:35:29,586 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24
[2018-04-11 20:35:29,587 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:29,587 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions.
[2018-04-11 20:35:29,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-04-11 20:35:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions.
[2018-04-11 20:35:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-04-11 20:35:29,588 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:29,588 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:29,589 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:29,589 INFO L82 PathProgramCache]: Analyzing trace with hash 289022877, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:29,597 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:29,618 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:29,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:29,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:29,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17
[2018-04-11 20:35:29,726 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:29,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-04-11 20:35:29,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,785 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:29,785 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:29,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:35:29,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12
[2018-04-11 20:35:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:29,812 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:29,935 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:29,936 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3
[2018-04-11 20:35:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:29,964 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:29,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8
[2018-04-11 20:35:29,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-04-11 20:35:29,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-04-11 20:35:29,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2018-04-11 20:35:29,965 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states.
[2018-04-11 20:35:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:30,140 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions.
[2018-04-11 20:35:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-04-11 20:35:30,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24
[2018-04-11 20:35:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:30,141 INFO L225 Difference]: With dead ends: 74
[2018-04-11 20:35:30,141 INFO L226 Difference]: Without dead ends: 73
[2018-04-11 20:35:30,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2018-04-11 20:35:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2018-04-11 20:35:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2018-04-11 20:35:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states.
[2018-04-11 20:35:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions.
[2018-04-11 20:35:30,147 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24
[2018-04-11 20:35:30,147 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:30,147 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions.
[2018-04-11 20:35:30,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-04-11 20:35:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions.
[2018-04-11 20:35:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-04-11 20:35:30,148 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:30,148 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:30,148 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 369774579, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:30,155 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:30,169 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:30,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:30,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:30,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:30,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-04-11 20:35:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,202 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,243 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:30,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3
[2018-04-11 20:35:30,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-04-11 20:35:30,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-04-11 20:35:30,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-04-11 20:35:30,244 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states.
[2018-04-11 20:35:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:30,343 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions.
[2018-04-11 20:35:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-04-11 20:35:30,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25
[2018-04-11 20:35:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:30,344 INFO L225 Difference]: With dead ends: 73
[2018-04-11 20:35:30,344 INFO L226 Difference]: Without dead ends: 72
[2018-04-11 20:35:30,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-04-11 20:35:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2018-04-11 20:35:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2018-04-11 20:35:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2018-04-11 20:35:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions.
[2018-04-11 20:35:30,349 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25
[2018-04-11 20:35:30,349 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:30,349 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions.
[2018-04-11 20:35:30,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-04-11 20:35:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions.
[2018-04-11 20:35:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-04-11 20:35:30,350 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:30,350 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:30,350 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:30,350 INFO L82 PathProgramCache]: Analyzing trace with hash 369774580, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:30,356 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:30,372 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:30,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:30,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:30,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:30,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12
[2018-04-11 20:35:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,415 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,475 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:30,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7
[2018-04-11 20:35:30,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-04-11 20:35:30,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-04-11 20:35:30,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2018-04-11 20:35:30,476 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states.
[2018-04-11 20:35:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:30,562 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions.
[2018-04-11 20:35:30,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-04-11 20:35:30,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25
[2018-04-11 20:35:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:30,563 INFO L225 Difference]: With dead ends: 72
[2018-04-11 20:35:30,563 INFO L226 Difference]: Without dead ends: 71
[2018-04-11 20:35:30,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2018-04-11 20:35:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2018-04-11 20:35:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2018-04-11 20:35:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states.
[2018-04-11 20:35:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions.
[2018-04-11 20:35:30,569 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25
[2018-04-11 20:35:30,570 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:30,570 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions.
[2018-04-11 20:35:30,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-04-11 20:35:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions.
[2018-04-11 20:35:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-04-11 20:35:30,570 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:30,570 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:30,570 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash -941306668, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:30,576 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:30,593 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,607 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,632 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:30,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4
[2018-04-11 20:35:30,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-04-11 20:35:30,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-04-11 20:35:30,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-04-11 20:35:30,633 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states.
[2018-04-11 20:35:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:30,692 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions.
[2018-04-11 20:35:30,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-04-11 20:35:30,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31
[2018-04-11 20:35:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:30,693 INFO L225 Difference]: With dead ends: 74
[2018-04-11 20:35:30,693 INFO L226 Difference]: Without dead ends: 73
[2018-04-11 20:35:30,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-04-11 20:35:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2018-04-11 20:35:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70.
[2018-04-11 20:35:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2018-04-11 20:35:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions.
[2018-04-11 20:35:30,698 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 31
[2018-04-11 20:35:30,698 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:30,698 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions.
[2018-04-11 20:35:30,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-04-11 20:35:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions.
[2018-04-11 20:35:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-04-11 20:35:30,699 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:30,699 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]
[2018-04-11 20:35:30,699 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash -941306667, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:30,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:30,726 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:30,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:30,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:30,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-11 20:35:30,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-04-11 20:35:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,791 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:30,873 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:30,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11
[2018-04-11 20:35:30,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:30,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:30,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-04-11 20:35:30,874 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states.
[2018-04-11 20:35:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:31,026 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions.
[2018-04-11 20:35:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-04-11 20:35:31,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31
[2018-04-11 20:35:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:31,027 INFO L225 Difference]: With dead ends: 87
[2018-04-11 20:35:31,027 INFO L226 Difference]: Without dead ends: 86
[2018-04-11 20:35:31,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272
[2018-04-11 20:35:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-04-11 20:35:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79.
[2018-04-11 20:35:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states.
[2018-04-11 20:35:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions.
[2018-04-11 20:35:31,036 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 31
[2018-04-11 20:35:31,037 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:31,037 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions.
[2018-04-11 20:35:31,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions.
[2018-04-11 20:35:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-04-11 20:35:31,038 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:31,039 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:31,039 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:31,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1776158873, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:31,048 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:31,078 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,111 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,137 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:31,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5
[2018-04-11 20:35:31,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-04-11 20:35:31,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-04-11 20:35:31,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-04-11 20:35:31,138 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states.
[2018-04-11 20:35:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:31,194 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions.
[2018-04-11 20:35:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-04-11 20:35:31,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39
[2018-04-11 20:35:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:31,195 INFO L225 Difference]: With dead ends: 79
[2018-04-11 20:35:31,195 INFO L226 Difference]: Without dead ends: 78
[2018-04-11 20:35:31,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-04-11 20:35:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2018-04-11 20:35:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2018-04-11 20:35:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2018-04-11 20:35:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions.
[2018-04-11 20:35:31,201 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39
[2018-04-11 20:35:31,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:31,201 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions.
[2018-04-11 20:35:31,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-04-11 20:35:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions.
[2018-04-11 20:35:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-04-11 20:35:31,203 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:31,203 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:31,203 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1776158874, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:31,210 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:31,233 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,292 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:31,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12
[2018-04-11 20:35:31,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:31,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 10
[2018-04-11 20:35:31,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:31,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:31,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7
[2018-04-11 20:35:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,360 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:31,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8
[2018-04-11 20:35:31,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-04-11 20:35:31,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-04-11 20:35:31,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-04-11 20:35:31,361 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states.
[2018-04-11 20:35:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:31,464 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions.
[2018-04-11 20:35:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:31,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39
[2018-04-11 20:35:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:31,465 INFO L225 Difference]: With dead ends: 85
[2018-04-11 20:35:31,465 INFO L226 Difference]: Without dead ends: 84
[2018-04-11 20:35:31,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2018-04-11 20:35:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-04-11 20:35:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2018-04-11 20:35:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-04-11 20:35:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions.
[2018-04-11 20:35:31,472 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39
[2018-04-11 20:35:31,472 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:31,473 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions.
[2018-04-11 20:35:31,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-04-11 20:35:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions.
[2018-04-11 20:35:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-04-11 20:35:31,473 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:31,474 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:31,474 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash -773649723, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:31,480 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:31,501 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,528 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,564 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:31,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5
[2018-04-11 20:35:31,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-04-11 20:35:31,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-04-11 20:35:31,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-04-11 20:35:31,565 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states.
[2018-04-11 20:35:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:31,622 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions.
[2018-04-11 20:35:31,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-04-11 20:35:31,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40
[2018-04-11 20:35:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:31,623 INFO L225 Difference]: With dead ends: 84
[2018-04-11 20:35:31,623 INFO L226 Difference]: Without dead ends: 83
[2018-04-11 20:35:31,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-04-11 20:35:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-04-11 20:35:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2018-04-11 20:35:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-04-11 20:35:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions.
[2018-04-11 20:35:31,630 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40
[2018-04-11 20:35:31,630 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:31,631 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions.
[2018-04-11 20:35:31,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-04-11 20:35:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions.
[2018-04-11 20:35:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-04-11 20:35:31,632 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:31,632 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:31,632 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:31,632 INFO L82 PathProgramCache]: Analyzing trace with hash -773649722, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:31,639 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:31,660 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:31,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:31,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:31,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:31,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-04-11 20:35:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,744 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:31,928 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:31,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15
[2018-04-11 20:35:31,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-04-11 20:35:31,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-04-11 20:35:31,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-04-11 20:35:31,929 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 16 states.
[2018-04-11 20:35:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:32,193 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions.
[2018-04-11 20:35:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-04-11 20:35:32,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40
[2018-04-11 20:35:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:32,195 INFO L225 Difference]: With dead ends: 110
[2018-04-11 20:35:32,196 INFO L226 Difference]: Without dead ends: 109
[2018-04-11 20:35:32,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650
[2018-04-11 20:35:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2018-04-11 20:35:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102.
[2018-04-11 20:35:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states.
[2018-04-11 20:35:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions.
[2018-04-11 20:35:32,204 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40
[2018-04-11 20:35:32,204 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:32,204 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions.
[2018-04-11 20:35:32,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-04-11 20:35:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions.
[2018-04-11 20:35:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-04-11 20:35:32,205 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:32,205 INFO L355 BasicCegarLoop]: trace histogram [3, 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-11 20:35:32,206 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1625754133, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:32,214 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:32,238 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:32,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:32,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:32,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:32,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-04-11 20:35:32,298 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 14 treesize of output 11
[2018-04-11 20:35:32,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:35:32,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:32,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:32,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:32,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-04-11 20:35:32,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2018-04-11 20:35:32,398 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 14 treesize of output 11
[2018-04-11 20:35:32,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:32,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:32,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:32,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35
[2018-04-11 20:35:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:32,497 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:32,673 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 13 treesize of output 11
[2018-04-11 20:35:32,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2018-04-11 20:35:32,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:32,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:32,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:32,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38
[2018-04-11 20:35:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:32,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:35:32,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24
[2018-04-11 20:35:32,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-04-11 20:35:32,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-04-11 20:35:32,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600
[2018-04-11 20:35:32,912 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 25 states.
[2018-04-11 20:35:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:33,850 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions.
[2018-04-11 20:35:33,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-04-11 20:35:33,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45
[2018-04-11 20:35:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:33,851 INFO L225 Difference]: With dead ends: 124
[2018-04-11 20:35:33,851 INFO L226 Difference]: Without dead ends: 123
[2018-04-11 20:35:33,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640
[2018-04-11 20:35:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2018-04-11 20:35:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109.
[2018-04-11 20:35:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2018-04-11 20:35:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions.
[2018-04-11 20:35:33,860 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45
[2018-04-11 20:35:33,860 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:33,860 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions.
[2018-04-11 20:35:33,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-04-11 20:35:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions.
[2018-04-11 20:35:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-04-11 20:35:33,861 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:33,861 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-11 20:35:33,861 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1969495212, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:33,872 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:33,895 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:33,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:33,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-04-11 20:35:33,918 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:33,919 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:33,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:35:33,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8
[2018-04-11 20:35:33,937 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 14 treesize of output 11
[2018-04-11 20:35:33,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:35:33,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:33,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25
[2018-04-11 20:35:33,961 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 25 treesize of output 26
[2018-04-11 20:35:33,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:35:33,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:33,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:33,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35
[2018-04-11 20:35:34,194 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 30 treesize of output 28
[2018-04-11 20:35:34,201 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 16 treesize of output 13
[2018-04-11 20:35:34,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:34,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2018-04-11 20:35:34,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:34,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:34,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:34,221 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29
[2018-04-11 20:35:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:34,285 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:34,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16 treesize of output 12
[2018-04-11 20:35:34,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:34,581 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 13 treesize of output 11
[2018-04-11 20:35:34,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2018-04-11 20:35:34,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:34,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:34,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:34,595 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7
[2018-04-11 20:35:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:34,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:35:34,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24
[2018-04-11 20:35:34,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-04-11 20:35:34,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-04-11 20:35:34,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600
[2018-04-11 20:35:34,651 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states.
[2018-04-11 20:35:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:35,312 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions.
[2018-04-11 20:35:35,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-04-11 20:35:35,313 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50
[2018-04-11 20:35:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:35,313 INFO L225 Difference]: With dead ends: 129
[2018-04-11 20:35:35,313 INFO L226 Difference]: Without dead ends: 128
[2018-04-11 20:35:35,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560
[2018-04-11 20:35:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2018-04-11 20:35:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120.
[2018-04-11 20:35:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-04-11 20:35:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions.
[2018-04-11 20:35:35,320 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50
[2018-04-11 20:35:35,321 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:35,321 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions.
[2018-04-11 20:35:35,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-04-11 20:35:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions.
[2018-04-11 20:35:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-04-11 20:35:35,321 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:35,322 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:35,322 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:35,322 INFO L82 PathProgramCache]: Analyzing trace with hash 4657691, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:35,327 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:35,345 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:35,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:35,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:35,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:35,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-04-11 20:35:35,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 14 treesize of output 11
[2018-04-11 20:35:35,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:35:35,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:35,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:35,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:35,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-04-11 20:35:35,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22
[2018-04-11 20:35:35,558 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:35,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31
[2018-04-11 20:35:35,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:35,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:35,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:35,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49
[2018-04-11 20:35:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:35,687 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:35,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-04-11 20:35:35,984 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:35:35,985 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12
[2018-04-11 20:35:35,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:35,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:35,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:35,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54
[2018-04-11 20:35:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:36,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:35:36,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30
[2018-04-11 20:35:36,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states
[2018-04-11 20:35:36,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2018-04-11 20:35:36,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930
[2018-04-11 20:35:36,170 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 31 states.
[2018-04-11 20:35:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:37,419 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions.
[2018-04-11 20:35:37,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-04-11 20:35:37,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52
[2018-04-11 20:35:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:37,421 INFO L225 Difference]: With dead ends: 148
[2018-04-11 20:35:37,421 INFO L226 Difference]: Without dead ends: 147
[2018-04-11 20:35:37,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=368, Invalid=2388, Unknown=0, NotChecked=0, Total=2756
[2018-04-11 20:35:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2018-04-11 20:35:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134.
[2018-04-11 20:35:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states.
[2018-04-11 20:35:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions.
[2018-04-11 20:35:37,430 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52
[2018-04-11 20:35:37,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:37,430 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions.
[2018-04-11 20:35:37,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states.
[2018-04-11 20:35:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions.
[2018-04-11 20:35:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-04-11 20:35:37,431 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:37,431 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:37,431 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash -953565311, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:37,437 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:37,456 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:37,484 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:37,485 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 20 treesize of output 27
[2018-04-11 20:35:37,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2018-04-11 20:35:37,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:37,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:37,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:37,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:37,538 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:37,543 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:37,553 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:37,571 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false
[2018-04-11 20:35:37,575 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false
[2018-04-11 20:35:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:37,637 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:37,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:37,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:37,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:37,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:37,638 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states.
[2018-04-11 20:35:37,654 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false
[2018-04-11 20:35:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:38,044 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions.
[2018-04-11 20:35:38,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:38,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54
[2018-04-11 20:35:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:38,046 INFO L225 Difference]: With dead ends: 249
[2018-04-11 20:35:38,046 INFO L226 Difference]: Without dead ends: 235
[2018-04-11 20:35:38,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states.
[2018-04-11 20:35:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232.
[2018-04-11 20:35:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states.
[2018-04-11 20:35:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions.
[2018-04-11 20:35:38,062 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54
[2018-04-11 20:35:38,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:38,063 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions.
[2018-04-11 20:35:38,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions.
[2018-04-11 20:35:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-04-11 20:35:38,063 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:38,064 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:38,064 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:38,064 INFO L82 PathProgramCache]: Analyzing trace with hash 61705302, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:38,070 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:38,093 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:38,137 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:38,138 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 20 treesize of output 21
[2018-04-11 20:35:38,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:38,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-04-11 20:35:38,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:38,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:38,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:38,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:38,213 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:38,217 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:38,228 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:38,247 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_18| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_18| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_18| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_18|))))) is different from false
[2018-04-11 20:35:38,251 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0))))) is different from false
[2018-04-11 20:35:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:38,298 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:38,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:38,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:38,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:38,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:38,299 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states.
[2018-04-11 20:35:38,322 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0)))))) is different from false
[2018-04-11 20:35:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:38,673 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions.
[2018-04-11 20:35:38,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:38,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55
[2018-04-11 20:35:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:38,675 INFO L225 Difference]: With dead ends: 347
[2018-04-11 20:35:38,675 INFO L226 Difference]: Without dead ends: 333
[2018-04-11 20:35:38,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states.
[2018-04-11 20:35:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233.
[2018-04-11 20:35:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states.
[2018-04-11 20:35:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions.
[2018-04-11 20:35:38,698 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55
[2018-04-11 20:35:38,698 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:38,699 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions.
[2018-04-11 20:35:38,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions.
[2018-04-11 20:35:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-04-11 20:35:38,701 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:38,701 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:38,701 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2135979729, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:38,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:38,738 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:38,769 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:38,770 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 20 treesize of output 27
[2018-04-11 20:35:38,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2018-04-11 20:35:38,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:38,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:38,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:38,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:38,841 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:38,846 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:38,854 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:38,874 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false
[2018-04-11 20:35:38,878 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|)))))) is different from false
[2018-04-11 20:35:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:38,922 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:38,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:38,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:38,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:38,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:38,923 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states.
[2018-04-11 20:35:38,932 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false
[2018-04-11 20:35:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:39,233 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions.
[2018-04-11 20:35:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:39,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55
[2018-04-11 20:35:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:39,235 INFO L225 Difference]: With dead ends: 348
[2018-04-11 20:35:39,235 INFO L226 Difference]: Without dead ends: 334
[2018-04-11 20:35:39,236 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states.
[2018-04-11 20:35:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235.
[2018-04-11 20:35:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states.
[2018-04-11 20:35:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions.
[2018-04-11 20:35:39,258 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55
[2018-04-11 20:35:39,258 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:39,258 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions.
[2018-04-11 20:35:39,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions.
[2018-04-11 20:35:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-04-11 20:35:39,259 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:39,260 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:39,260 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash 183707505, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:39,268 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:39,290 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:39,320 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:39,321 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 20 treesize of output 21
[2018-04-11 20:35:39,325 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:39,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-04-11 20:35:39,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:39,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:39,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:39,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:39,362 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:39,365 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:39,372 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:39,424 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false
[2018-04-11 20:35:39,428 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false
[2018-04-11 20:35:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:39,483 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:39,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:39,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:39,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:39,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:39,484 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states.
[2018-04-11 20:35:39,496 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false
[2018-04-11 20:35:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:39,813 INFO L93 Difference]: Finished difference Result 349 states and 378 transitions.
[2018-04-11 20:35:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:39,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55
[2018-04-11 20:35:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:39,815 INFO L225 Difference]: With dead ends: 349
[2018-04-11 20:35:39,815 INFO L226 Difference]: Without dead ends: 335
[2018-04-11 20:35:39,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states.
[2018-04-11 20:35:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235.
[2018-04-11 20:35:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states.
[2018-04-11 20:35:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions.
[2018-04-11 20:35:39,835 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55
[2018-04-11 20:35:39,835 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:39,836 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions.
[2018-04-11 20:35:39,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions.
[2018-04-11 20:35:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-04-11 20:35:39,837 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:39,837 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:39,837 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash -750369636, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:39,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:39,865 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:39,884 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:39,885 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 20 treesize of output 27
[2018-04-11 20:35:39,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2018-04-11 20:35:39,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:39,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:39,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:39,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:39,929 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:39,933 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:39,940 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:39,956 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false
[2018-04-11 20:35:39,959 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false
[2018-04-11 20:35:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:39,991 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:39,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:39,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:39,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:39,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:39,992 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states.
[2018-04-11 20:35:40,000 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false
[2018-04-11 20:35:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:40,349 INFO L93 Difference]: Finished difference Result 350 states and 379 transitions.
[2018-04-11 20:35:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:40,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56
[2018-04-11 20:35:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:40,385 INFO L225 Difference]: With dead ends: 350
[2018-04-11 20:35:40,386 INFO L226 Difference]: Without dead ends: 336
[2018-04-11 20:35:40,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2018-04-11 20:35:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 235.
[2018-04-11 20:35:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states.
[2018-04-11 20:35:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions.
[2018-04-11 20:35:40,405 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 56
[2018-04-11 20:35:40,405 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:40,405 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions.
[2018-04-11 20:35:40,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions.
[2018-04-11 20:35:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-04-11 20:35:40,406 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:40,406 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:40,406 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:40,406 INFO L82 PathProgramCache]: Analyzing trace with hash 957424230, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:40,412 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:40,432 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:40,454 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:40,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27
[2018-04-11 20:35:40,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2018-04-11 20:35:40,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:40,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:40,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:40,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:40,503 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:40,508 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:40,518 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:40,540 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_26| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_26|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_26| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_26| 0) |c_old(#valid)|))) is different from false
[2018-04-11 20:35:40,544 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) is different from false
[2018-04-11 20:35:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:40,586 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:40,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:40,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:40,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:40,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:40,587 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states.
[2018-04-11 20:35:40,598 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false
[2018-04-11 20:35:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:40,968 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions.
[2018-04-11 20:35:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:40,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56
[2018-04-11 20:35:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:40,971 INFO L225 Difference]: With dead ends: 348
[2018-04-11 20:35:40,971 INFO L226 Difference]: Without dead ends: 334
[2018-04-11 20:35:40,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states.
[2018-04-11 20:35:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 234.
[2018-04-11 20:35:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states.
[2018-04-11 20:35:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions.
[2018-04-11 20:35:40,998 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56
[2018-04-11 20:35:40,998 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:40,998 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions.
[2018-04-11 20:35:40,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions.
[2018-04-11 20:35:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-04-11 20:35:40,999 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:40,999 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:40,999 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:41,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1263268639, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:41,008 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:41,035 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:41,071 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:41,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27
[2018-04-11 20:35:41,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2018-04-11 20:35:41,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:41,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:41,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:41,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:41,109 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:41,112 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:41,123 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:41,141 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_28| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_28|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_28| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|))) is different from false
[2018-04-11 20:35:41,144 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0))))) is different from false
[2018-04-11 20:35:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:41,193 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:41,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:41,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:41,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:41,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:41,194 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states.
[2018-04-11 20:35:41,228 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0)))))) is different from false
[2018-04-11 20:35:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:42,035 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions.
[2018-04-11 20:35:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:42,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56
[2018-04-11 20:35:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:42,037 INFO L225 Difference]: With dead ends: 349
[2018-04-11 20:35:42,037 INFO L226 Difference]: Without dead ends: 335
[2018-04-11 20:35:42,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states.
[2018-04-11 20:35:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234.
[2018-04-11 20:35:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states.
[2018-04-11 20:35:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions.
[2018-04-11 20:35:42,054 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56
[2018-04-11 20:35:42,054 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:42,054 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions.
[2018-04-11 20:35:42,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions.
[2018-04-11 20:35:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-04-11 20:35:42,055 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:42,055 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:42,055 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1247113356, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:42,062 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:42,084 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:42,288 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:42,289 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 20 treesize of output 27
[2018-04-11 20:35:42,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2018-04-11 20:35:42,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:42,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15
[2018-04-11 20:35:42,408 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true
[2018-04-11 20:35:42,411 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true
[2018-04-11 20:35:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:42,419 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:42,497 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_30|))) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc11.base_30| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_30| 0)))) is different from false
[2018-04-11 20:35:42,500 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|)))) is different from false
[2018-04-11 20:35:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:42,536 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 20:35:42,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 20:35:42,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 20:35:42,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 20:35:42,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132
[2018-04-11 20:35:42,537 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states.
[2018-04-11 20:35:42,574 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|))))) is different from false
[2018-04-11 20:35:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:42,878 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions.
[2018-04-11 20:35:42,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-04-11 20:35:42,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57
[2018-04-11 20:35:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:42,879 INFO L225 Difference]: With dead ends: 237
[2018-04-11 20:35:42,880 INFO L226 Difference]: Without dead ends: 223
[2018-04-11 20:35:42,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306
[2018-04-11 20:35:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states.
[2018-04-11 20:35:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120.
[2018-04-11 20:35:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-04-11 20:35:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions.
[2018-04-11 20:35:42,896 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57
[2018-04-11 20:35:42,897 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:42,897 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions.
[2018-04-11 20:35:42,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 20:35:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions.
[2018-04-11 20:35:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-04-11 20:35:42,897 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:42,897 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:35:42,898 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1035920506, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:42,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:42,934 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:42,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:42,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:42,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13
[2018-04-11 20:35:42,974 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:42,975 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:42,975 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-11 20:35:42,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,984 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:42,984 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:42,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:35:42,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:42,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13
[2018-04-11 20:35:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:43,223 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:43,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2018-04-11 20:35:43,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:43,689 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15
[2018-04-11 20:35:43,696 WARN L307 Elim1Store]: Array PQE input equivalent to true
[2018-04-11 20:35:43,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:43,697 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 3
[2018-04-11 20:35:43,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:43,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:43,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:43,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7
[2018-04-11 20:35:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:43,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:35:43,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38
[2018-04-11 20:35:43,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-04-11 20:35:43,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-04-11 20:35:43,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482
[2018-04-11 20:35:43,763 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states.
[2018-04-11 20:35:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:35:46,017 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions.
[2018-04-11 20:35:46,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-04-11 20:35:46,018 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58
[2018-04-11 20:35:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:35:46,018 INFO L225 Difference]: With dead ends: 152
[2018-04-11 20:35:46,018 INFO L226 Difference]: Without dead ends: 151
[2018-04-11 20:35:46,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=607, Invalid=5399, Unknown=0, NotChecked=0, Total=6006
[2018-04-11 20:35:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2018-04-11 20:35:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120.
[2018-04-11 20:35:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-04-11 20:35:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions.
[2018-04-11 20:35:46,037 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58
[2018-04-11 20:35:46,037 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:35:46,038 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions.
[2018-04-11 20:35:46,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-04-11 20:35:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions.
[2018-04-11 20:35:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-04-11 20:35:46,038 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:35:46,039 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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]
[2018-04-11 20:35:46,039 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:35:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2054739622, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:35:46,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:35:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:35:46,067 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:35:46,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:46,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:35:46,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-04-11 20:35:46,090 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:46,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-04-11 20:35:46,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,099 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:46,099 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:35:46,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:35:46,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13
[2018-04-11 20:35:46,119 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 15 treesize of output 12
[2018-04-11 20:35:46,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-04-11 20:35:46,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16
[2018-04-11 20:35:46,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27
[2018-04-11 20:35:46,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:35:46,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:46,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:35:46,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26
[2018-04-11 20:35:46,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32
[2018-04-11 20:35:46,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25
[2018-04-11 20:35:46,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:46,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:46,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-04-11 20:35:46,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45
[2018-04-11 20:35:46,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17
[2018-04-11 20:35:46,427 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 17 treesize of output 14
[2018-04-11 20:35:46,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:46,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:46,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:35:46,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32
[2018-04-11 20:35:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:46,509 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:35:47,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30
[2018-04-11 20:35:47,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-04-11 20:35:47,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:47,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 22 treesize of output 20
[2018-04-11 20:35:47,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2018-04-11 20:35:47,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:47,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:47,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17
[2018-04-11 20:35:47,356 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 17 treesize of output 12
[2018-04-11 20:35:47,357 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:47,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:35:47,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts.
[2018-04-11 20:35:47,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts.
[2018-04-11 20:35:47,388 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:84
[2018-04-11 20:35:48,204 WARN L151 SmtUtils]: Spent 651ms on a formula simplification. DAG size of input: 37 DAG size of output 34
[2018-04-11 20:35:48,581 WARN L148 SmtUtils]: Spent 325ms on a formula simplification that was a NOOP. DAG size: 34
[2018-04-11 20:35:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:35:48,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:35:48,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38
[2018-04-11 20:35:48,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-04-11 20:35:48,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-04-11 20:35:48,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482
[2018-04-11 20:35:48,627 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states.
[2018-04-11 20:36:07,095 WARN L151 SmtUtils]: Spent 15500ms on a formula simplification. DAG size of input: 71 DAG size of output 53
[2018-04-11 20:36:10,424 WARN L151 SmtUtils]: Spent 1976ms on a formula simplification. DAG size of input: 49 DAG size of output 34
[2018-04-11 20:36:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:36:10,937 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions.
[2018-04-11 20:36:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-04-11 20:36:10,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61
[2018-04-11 20:36:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:36:10,938 INFO L225 Difference]: With dead ends: 137
[2018-04-11 20:36:10,938 INFO L226 Difference]: Without dead ends: 136
[2018-04-11 20:36:10,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=315, Invalid=2990, Unknown=1, NotChecked=0, Total=3306
[2018-04-11 20:36:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2018-04-11 20:36:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131.
[2018-04-11 20:36:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2018-04-11 20:36:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions.
[2018-04-11 20:36:10,951 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 61
[2018-04-11 20:36:10,951 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:36:10,951 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions.
[2018-04-11 20:36:10,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-04-11 20:36:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions.
[2018-04-11 20:36:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-04-11 20:36:10,952 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:36:10,952 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:36:10,952 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:36:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 727581190, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:36:10,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:36:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:36:10,984 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:36:11,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:11,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:11,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:11,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:11,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:11,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13
[2018-04-11 20:36:11,246 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:11,247 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:11,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:36:11,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:11,293 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:11,294 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-11 20:36:11,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:11,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:11,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13
[2018-04-11 20:36:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:11,669 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:36:12,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1
[2018-04-11 20:36:12,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:12,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 11 treesize of output 15
[2018-04-11 20:36:12,335 WARN L307 Elim1Store]: Array PQE input equivalent to true
[2018-04-11 20:36:12,336 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:12,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 20:36:12,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:12,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:12,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:12,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7
[2018-04-11 20:36:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:12,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:36:12,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45
[2018-04-11 20:36:12,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-04-11 20:36:12,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-04-11 20:36:12,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070
[2018-04-11 20:36:12,429 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 46 states.
[2018-04-11 20:36:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:36:15,680 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions.
[2018-04-11 20:36:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2018-04-11 20:36:15,680 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62
[2018-04-11 20:36:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:36:15,681 INFO L225 Difference]: With dead ends: 189
[2018-04-11 20:36:15,681 INFO L226 Difference]: Without dead ends: 188
[2018-04-11 20:36:15,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=935, Invalid=8185, Unknown=0, NotChecked=0, Total=9120
[2018-04-11 20:36:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2018-04-11 20:36:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182.
[2018-04-11 20:36:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states.
[2018-04-11 20:36:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions.
[2018-04-11 20:36:15,697 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 62
[2018-04-11 20:36:15,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:36:15,697 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions.
[2018-04-11 20:36:15,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-04-11 20:36:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions.
[2018-04-11 20:36:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-04-11 20:36:15,698 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:36:15,698 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:36:15,699 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:36:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash -740387276, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:36:15,705 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:36:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:36:15,733 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:36:15,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:15,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:15,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:15,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-04-11 20:36:15,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11
[2018-04-11 20:36:15,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:36:15,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:15,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:15,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:36:15,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-04-11 20:36:15,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22
[2018-04-11 20:36:15,884 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:15,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31
[2018-04-11 20:36:15,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:15,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:15,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:15,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49
[2018-04-11 20:36:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:16,047 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:36:16,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-04-11 20:36:16,391 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:16,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12
[2018-04-11 20:36:16,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:16,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:16,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:16,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54
[2018-04-11 20:36:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:16,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:36:16,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34
[2018-04-11 20:36:16,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states
[2018-04-11 20:36:16,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2018-04-11 20:36:16,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190
[2018-04-11 20:36:16,587 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 35 states.
[2018-04-11 20:36:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:36:18,933 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions.
[2018-04-11 20:36:18,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2018-04-11 20:36:18,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65
[2018-04-11 20:36:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:36:18,935 INFO L225 Difference]: With dead ends: 225
[2018-04-11 20:36:18,935 INFO L226 Difference]: Without dead ends: 224
[2018-04-11 20:36:18,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=622, Invalid=4928, Unknown=0, NotChecked=0, Total=5550
[2018-04-11 20:36:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states.
[2018-04-11 20:36:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 201.
[2018-04-11 20:36:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states.
[2018-04-11 20:36:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions.
[2018-04-11 20:36:18,957 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 65
[2018-04-11 20:36:18,958 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:36:18,958 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions.
[2018-04-11 20:36:18,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states.
[2018-04-11 20:36:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions.
[2018-04-11 20:36:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-04-11 20:36:18,958 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:36:18,958 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:36:18,959 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:36:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash -76833573, now seen corresponding path program 3 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:36:18,967 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:36:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:36:18,989 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:36:19,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:19,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:19,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:19,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-04-11 20:36:19,027 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 14 treesize of output 11
[2018-04-11 20:36:19,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:36:19,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:19,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:19,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:36:19,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-04-11 20:36:19,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38
[2018-04-11 20:36:19,319 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:19,320 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:19,320 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:19,321 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:19,321 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:19,323 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:19,332 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 38 treesize of output 93
[2018-04-11 20:36:19,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:19,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:19,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:19,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73
[2018-04-11 20:36:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:19,520 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:36:20,099 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 59 treesize of output 51
[2018-04-11 20:36:20,132 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:20,132 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:20,132 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:20,133 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:20,133 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:20,133 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:20,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49
[2018-04-11 20:36:20,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:20,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:20,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:20,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86
[2018-04-11 20:36:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:20,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:36:20,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42
[2018-04-11 20:36:20,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states
[2018-04-11 20:36:20,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2018-04-11 20:36:20,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806
[2018-04-11 20:36:20,400 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 43 states.
[2018-04-11 20:36:22,259 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 69 DAG size of output 63
[2018-04-11 20:36:22,689 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 70 DAG size of output 60
[2018-04-11 20:36:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:36:23,492 INFO L93 Difference]: Finished difference Result 251 states and 268 transitions.
[2018-04-11 20:36:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2018-04-11 20:36:23,492 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 66
[2018-04-11 20:36:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:36:23,493 INFO L225 Difference]: With dead ends: 251
[2018-04-11 20:36:23,493 INFO L226 Difference]: Without dead ends: 250
[2018-04-11 20:36:23,494 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=871, Invalid=5449, Unknown=0, NotChecked=0, Total=6320
[2018-04-11 20:36:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states.
[2018-04-11 20:36:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 229.
[2018-04-11 20:36:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states.
[2018-04-11 20:36:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 243 transitions.
[2018-04-11 20:36:23,512 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 243 transitions. Word has length 66
[2018-04-11 20:36:23,512 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:36:23,512 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 243 transitions.
[2018-04-11 20:36:23,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states.
[2018-04-11 20:36:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 243 transitions.
[2018-04-11 20:36:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2018-04-11 20:36:23,513 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:36:23,513 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:36:23,513 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:36:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1610415124, now seen corresponding path program 3 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:36:23,519 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:36:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:36:23,544 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:36:23,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:23,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:23,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-04-11 20:36:23,566 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:23,567 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:23,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:36:23,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-04-11 20:36:23,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13
[2018-04-11 20:36:23,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12
[2018-04-11 20:36:23,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-04-11 20:36:23,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16
[2018-04-11 20:36:23,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27
[2018-04-11 20:36:23,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 11 treesize of output 10
[2018-04-11 20:36:23,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:36:23,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26
[2018-04-11 20:36:23,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32
[2018-04-11 20:36:23,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25
[2018-04-11 20:36:23,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:23,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:23,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-04-11 20:36:23,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49
[2018-04-11 20:36:23,922 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 23 treesize of output 24
[2018-04-11 20:36:23,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-04-11 20:36:23,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:23,934 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-11 20:36:23,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15
[2018-04-11 20:36:24,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17
[2018-04-11 20:36:24,005 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 17 treesize of output 14
[2018-04-11 20:36:24,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:24,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:24,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:24,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32
[2018-04-11 20:36:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:24,104 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:36:25,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 31
[2018-04-11 20:36:25,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-04-11 20:36:25,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2018-04-11 20:36:25,367 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 15 treesize of output 10
[2018-04-11 20:36:25,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,376 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 32 treesize of output 34
[2018-04-11 20:36:25,378 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 29 treesize of output 24
[2018-04-11 20:36:25,378 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 24
[2018-04-11 20:36:25,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:36:25,401 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12
[2018-04-11 20:36:25,406 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:25,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts.
[2018-04-11 20:36:25,466 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52
[2018-04-11 20:36:25,536 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 35 treesize of output 24
[2018-04-11 20:36:25,536 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,538 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 35 treesize of output 24
[2018-04-11 20:36:25,539 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,541 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:25,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25
[2018-04-11 20:36:25,542 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,612 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32
[2018-04-11 20:36:25,613 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts.
[2018-04-11 20:36:25,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32
[2018-04-11 20:36:25,626 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts.
[2018-04-11 20:36:25,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22
[2018-04-11 20:36:25,686 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:25,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22
[2018-04-11 20:36:25,701 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:25,725 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-04-11 20:36:25,748 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-04-11 20:36:25,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-04-11 20:36:25,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32
[2018-04-11 20:36:25,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26
[2018-04-11 20:36:25,780 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:25,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26
[2018-04-11 20:36:25,786 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:25,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2018-04-11 20:36:25,788 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:25,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32
[2018-04-11 20:36:25,828 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts.
[2018-04-11 20:36:25,833 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 23 treesize of output 19
[2018-04-11 20:36:25,834 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:25,858 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-04-11 20:36:25,875 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-04-11 20:36:25,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts.
[2018-04-11 20:36:25,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts.
[2018-04-11 20:36:25,929 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84
[2018-04-11 20:36:26,403 WARN L151 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 37 DAG size of output 34
[2018-04-11 20:36:26,765 WARN L148 SmtUtils]: Spent 299ms on a formula simplification that was a NOOP. DAG size: 34
[2018-04-11 20:36:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:26,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:36:26,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48
[2018-04-11 20:36:26,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-04-11 20:36:26,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-04-11 20:36:26,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352
[2018-04-11 20:36:26,815 INFO L87 Difference]: Start difference. First operand 229 states and 243 transitions. Second operand 49 states.
[2018-04-11 20:36:28,252 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 125 DAG size of output 85
[2018-04-11 20:36:29,122 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 104 DAG size of output 73
[2018-04-11 20:36:29,417 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 102 DAG size of output 78
[2018-04-11 20:36:29,774 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 106 DAG size of output 81
[2018-04-11 20:36:30,045 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 92 DAG size of output 67
[2018-04-11 20:36:32,118 WARN L151 SmtUtils]: Spent 1994ms on a formula simplification. DAG size of input: 88 DAG size of output 57
[2018-04-11 20:36:32,586 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 89 DAG size of output 48
[2018-04-11 20:36:33,044 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 98 DAG size of output 45
[2018-04-11 20:36:33,763 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 93 DAG size of output 51
[2018-04-11 20:36:34,209 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 100 DAG size of output 48
[2018-04-11 20:36:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:36:36,619 INFO L93 Difference]: Finished difference Result 235 states and 248 transitions.
[2018-04-11 20:36:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-04-11 20:36:36,620 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72
[2018-04-11 20:36:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:36:36,621 INFO L225 Difference]: With dead ends: 235
[2018-04-11 20:36:36,621 INFO L226 Difference]: Without dead ends: 234
[2018-04-11 20:36:36,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=813, Invalid=5667, Unknown=0, NotChecked=0, Total=6480
[2018-04-11 20:36:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states.
[2018-04-11 20:36:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154.
[2018-04-11 20:36:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states.
[2018-04-11 20:36:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions.
[2018-04-11 20:36:36,639 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 72
[2018-04-11 20:36:36,639 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:36:36,639 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions.
[2018-04-11 20:36:36,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-04-11 20:36:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions.
[2018-04-11 20:36:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-04-11 20:36:36,640 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:36:36,640 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:36:36,640 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:36:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2103712966, now seen corresponding path program 3 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:36:36,646 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:36:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:36:36,674 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:36:36,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:36,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:36,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:36:36,711 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:36,711 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:36,712 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-11 20:36:36,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,722 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:36,722 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:36,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:36:36,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:36:36,747 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 14 treesize of output 11
[2018-04-11 20:36:36,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:36:36,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:36,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:36:36,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:36:36,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2018-04-11 20:36:36,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11
[2018-04-11 20:36:36,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:36,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:36,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:36,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46
[2018-04-11 20:36:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:37,201 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:36:37,945 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 13 treesize of output 11
[2018-04-11 20:36:37,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2018-04-11 20:36:37,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:37,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:37,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:37,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45
[2018-04-11 20:36:38,211 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 27 treesize of output 21
[2018-04-11 20:36:38,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:38,223 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 27 treesize of output 21
[2018-04-11 20:36:38,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:38,234 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:36:38,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3
[2018-04-11 20:36:38,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:38,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:38,263 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:36:38,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3
[2018-04-11 20:36:38,277 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:38,281 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:38,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:38,290 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:36:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:38,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:36:38,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52
[2018-04-11 20:36:38,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states
[2018-04-11 20:36:38,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2018-04-11 20:36:38,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2590, Unknown=0, NotChecked=0, Total=2756
[2018-04-11 20:36:38,375 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 53 states.
[2018-04-11 20:36:39,890 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 87 DAG size of output 73
[2018-04-11 20:36:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:36:43,965 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions.
[2018-04-11 20:36:43,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2018-04-11 20:36:43,965 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 76
[2018-04-11 20:36:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:36:43,967 INFO L225 Difference]: With dead ends: 247
[2018-04-11 20:36:43,967 INFO L226 Difference]: Without dead ends: 246
[2018-04-11 20:36:43,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3219 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1045, Invalid=12997, Unknown=0, NotChecked=0, Total=14042
[2018-04-11 20:36:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states.
[2018-04-11 20:36:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 154.
[2018-04-11 20:36:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states.
[2018-04-11 20:36:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions.
[2018-04-11 20:36:43,986 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 76
[2018-04-11 20:36:43,987 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:36:43,987 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions.
[2018-04-11 20:36:43,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states.
[2018-04-11 20:36:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions.
[2018-04-11 20:36:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2018-04-11 20:36:43,987 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:36:43,987 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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]
[2018-04-11 20:36:43,987 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:36:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash 138511220, now seen corresponding path program 4 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:36:43,993 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:36:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:36:44,021 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:36:44,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:44,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:44,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:36:44,053 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:44,054 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:44,054 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-11 20:36:44,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,064 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:44,065 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:44,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:36:44,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:36:44,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 14 treesize of output 11
[2018-04-11 20:36:44,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:36:44,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:44,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:36:44,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:36:44,299 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 38 treesize of output 30
[2018-04-11 20:36:44,302 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:44,303 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:44,303 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:44,310 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 1 case distinctions, treesize of input 30 treesize of output 58
[2018-04-11 20:36:44,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:44,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:44,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:44,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84
[2018-04-11 20:36:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:44,702 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:36:45,683 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 38
[2018-04-11 20:36:45,705 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:45,705 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:45,706 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:36:45,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27
[2018-04-11 20:36:45,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:45,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:45,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:45,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77
[2018-04-11 20:36:46,016 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 27 treesize of output 21
[2018-04-11 20:36:46,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:46,028 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:36:46,041 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 3
[2018-04-11 20:36:46,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:46,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:46,057 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30
[2018-04-11 20:36:46,073 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 3
[2018-04-11 20:36:46,073 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:46,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:46,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13
[2018-04-11 20:36:46,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:46,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:36:46,099 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:36:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:46,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:36:46,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56
[2018-04-11 20:36:46,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states
[2018-04-11 20:36:46,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants.
[2018-04-11 20:36:46,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2969, Unknown=0, NotChecked=0, Total=3192
[2018-04-11 20:36:46,192 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 57 states.
[2018-04-11 20:36:47,929 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 101 DAG size of output 69
[2018-04-11 20:36:49,602 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 96 DAG size of output 82
[2018-04-11 20:36:50,485 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 75 DAG size of output 72
[2018-04-11 20:36:50,672 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 86 DAG size of output 80
[2018-04-11 20:36:51,521 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 89 DAG size of output 75
[2018-04-11 20:36:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:36:54,455 INFO L93 Difference]: Finished difference Result 255 states and 270 transitions.
[2018-04-11 20:36:54,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states.
[2018-04-11 20:36:54,455 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79
[2018-04-11 20:36:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:36:54,456 INFO L225 Difference]: With dead ends: 255
[2018-04-11 20:36:54,456 INFO L226 Difference]: Without dead ends: 254
[2018-04-11 20:36:54,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1487, Invalid=15283, Unknown=0, NotChecked=0, Total=16770
[2018-04-11 20:36:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states.
[2018-04-11 20:36:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154.
[2018-04-11 20:36:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states.
[2018-04-11 20:36:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions.
[2018-04-11 20:36:54,488 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 79
[2018-04-11 20:36:54,489 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:36:54,489 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions.
[2018-04-11 20:36:54,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states.
[2018-04-11 20:36:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions.
[2018-04-11 20:36:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2018-04-11 20:36:54,490 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:36:54,490 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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]
[2018-04-11 20:36:54,490 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:36:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1497310022, now seen corresponding path program 5 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:36:54,500 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:36:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:36:54,528 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:36:54,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:54,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:54,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:36:54,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:54,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:54,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13
[2018-04-11 20:36:54,554 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:54,555 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:54,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:36:54,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:54,561 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:36:54,561 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-11 20:36:54,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:54,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:54,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13
[2018-04-11 20:36:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:54,992 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:36:55,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2018-04-11 20:36:55,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:55,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15
[2018-04-11 20:36:55,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3
[2018-04-11 20:36:55,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:55,953 WARN L307 Elim1Store]: Array PQE input equivalent to true
[2018-04-11 20:36:55,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:55,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:55,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:36:55,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7
[2018-04-11 20:36:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:36:56,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:36:56,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54
[2018-04-11 20:36:56,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states
[2018-04-11 20:36:56,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants.
[2018-04-11 20:36:56,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2793, Unknown=0, NotChecked=0, Total=2970
[2018-04-11 20:36:56,028 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 55 states.
[2018-04-11 20:37:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:37:00,783 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions.
[2018-04-11 20:37:00,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2018-04-11 20:37:00,783 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80
[2018-04-11 20:37:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:37:00,785 INFO L225 Difference]: With dead ends: 273
[2018-04-11 20:37:00,785 INFO L226 Difference]: Without dead ends: 272
[2018-04-11 20:37:00,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1348, Invalid=14654, Unknown=0, NotChecked=0, Total=16002
[2018-04-11 20:37:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states.
[2018-04-11 20:37:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 176.
[2018-04-11 20:37:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states.
[2018-04-11 20:37:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions.
[2018-04-11 20:37:00,805 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 80
[2018-04-11 20:37:00,805 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:37:00,805 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions.
[2018-04-11 20:37:00,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states.
[2018-04-11 20:37:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions.
[2018-04-11 20:37:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2018-04-11 20:37:00,806 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:37:00,807 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:37:00,807 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:37:00,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1524329472, now seen corresponding path program 6 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:37:00,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:37:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:37:00,850 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:37:00,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:00,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:00,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:37:00,901 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:00,902 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:00,902 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-11 20:37:00,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,913 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:00,914 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:00,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:37:00,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:37:00,941 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 14 treesize of output 11
[2018-04-11 20:37:00,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:37:00,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:00,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:37:00,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:37:01,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22
[2018-04-11 20:37:01,095 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:01,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31
[2018-04-11 20:37:01,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:01,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:01,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:01,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66
[2018-04-11 20:37:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:01,595 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:37:02,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-04-11 20:37:02,598 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:02,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12
[2018-04-11 20:37:02,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61
[2018-04-11 20:37:02,900 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30
[2018-04-11 20:37:02,915 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 3
[2018-04-11 20:37:02,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13
[2018-04-11 20:37:02,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,946 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 27 treesize of output 21
[2018-04-11 20:37:02,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:37:02,971 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 3
[2018-04-11 20:37:02,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,975 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:02,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:02,984 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:37:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:03,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:37:03,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58
[2018-04-11 20:37:03,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states
[2018-04-11 20:37:03,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2018-04-11 20:37:03,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3219, Unknown=0, NotChecked=0, Total=3422
[2018-04-11 20:37:03,079 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 59 states.
[2018-04-11 20:37:05,274 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 87 DAG size of output 78
[2018-04-11 20:37:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:37:10,450 INFO L93 Difference]: Finished difference Result 299 states and 314 transitions.
[2018-04-11 20:37:10,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states.
[2018-04-11 20:37:10,451 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 83
[2018-04-11 20:37:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:37:10,452 INFO L225 Difference]: With dead ends: 299
[2018-04-11 20:37:10,452 INFO L226 Difference]: Without dead ends: 298
[2018-04-11 20:37:10,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1379, Invalid=17253, Unknown=0, NotChecked=0, Total=18632
[2018-04-11 20:37:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2018-04-11 20:37:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 177.
[2018-04-11 20:37:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states.
[2018-04-11 20:37:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions.
[2018-04-11 20:37:10,472 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 83
[2018-04-11 20:37:10,472 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:37:10,472 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions.
[2018-04-11 20:37:10,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states.
[2018-04-11 20:37:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions.
[2018-04-11 20:37:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2018-04-11 20:37:10,472 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:37:10,473 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:37:10,473 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:37:10,473 INFO L82 PathProgramCache]: Analyzing trace with hash 882641222, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:37:10,478 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:37:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:37:10,509 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:37:10,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:10,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:10,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:10,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:10,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:10,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13
[2018-04-11 20:37:10,545 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:10,546 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:10,546 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-11 20:37:10,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:10,555 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:10,555 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:10,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:37:10,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:10,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:10,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13
[2018-04-11 20:37:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:11,103 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:37:12,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1
[2018-04-11 20:37:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:12,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 11 treesize of output 15
[2018-04-11 20:37:12,288 WARN L307 Elim1Store]: Array PQE input equivalent to true
[2018-04-11 20:37:12,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:12,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 20:37:12,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:12,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:12,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:12,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7
[2018-04-11 20:37:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:12,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:37:12,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61
[2018-04-11 20:37:12,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states
[2018-04-11 20:37:12,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants.
[2018-04-11 20:37:12,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3529, Unknown=0, NotChecked=0, Total=3782
[2018-04-11 20:37:12,407 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 62 states.
[2018-04-11 20:37:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:37:19,095 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions.
[2018-04-11 20:37:19,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states.
[2018-04-11 20:37:19,096 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 84
[2018-04-11 20:37:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:37:19,097 INFO L225 Difference]: With dead ends: 314
[2018-04-11 20:37:19,097 INFO L226 Difference]: Without dead ends: 313
[2018-04-11 20:37:19,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4935 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2214, Invalid=20738, Unknown=0, NotChecked=0, Total=22952
[2018-04-11 20:37:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states.
[2018-04-11 20:37:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 200.
[2018-04-11 20:37:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states.
[2018-04-11 20:37:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions.
[2018-04-11 20:37:19,132 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 84
[2018-04-11 20:37:19,133 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:37:19,133 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions.
[2018-04-11 20:37:19,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states.
[2018-04-11 20:37:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions.
[2018-04-11 20:37:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2018-04-11 20:37:19,134 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:37:19,134 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:37:19,134 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:37:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash -39632293, now seen corresponding path program 4 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:37:19,143 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:37:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:37:19,190 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:37:19,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:19,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:19,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:19,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-04-11 20:37:19,258 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 14 treesize of output 11
[2018-04-11 20:37:19,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:37:19,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:19,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:19,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:37:19,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-04-11 20:37:20,386 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 88 treesize of output 70
[2018-04-11 20:37:20,390 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,391 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,392 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,396 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,397 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,398 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,398 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,400 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,401 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,402 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,403 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,403 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,404 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,405 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,405 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,406 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,407 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,407 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,408 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,409 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,409 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,410 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,411 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,411 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,412 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,412 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,413 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,414 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:20,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 42 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 313
[2018-04-11 20:37:20,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:20,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:20,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:20,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:129
[2018-04-11 20:37:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:20,960 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:37:22,916 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 119 treesize of output 103
[2018-04-11 20:37:22,987 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,988 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,988 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,988 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,989 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,989 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,989 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,989 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,990 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,990 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,990 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,991 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,991 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,991 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,992 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,992 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,992 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,993 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,993 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,993 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,994 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,994 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,994 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,994 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,995 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,995 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,995 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:22,995 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:23,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 44 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 207
[2018-04-11 20:37:23,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:23,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:23,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:23,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:150
[2018-04-11 20:37:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:23,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:37:23,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66
[2018-04-11 20:37:23,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states
[2018-04-11 20:37:23,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants.
[2018-04-11 20:37:23,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=3863, Unknown=0, NotChecked=0, Total=4422
[2018-04-11 20:37:23,506 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 67 states.
[2018-04-11 20:37:27,228 WARN L151 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 137 DAG size of output 121
[2018-04-11 20:37:27,536 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 131 DAG size of output 116
[2018-04-11 20:37:27,827 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 88 DAG size of output 74
[2018-04-11 20:37:28,083 WARN L148 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 97
[2018-04-11 20:37:28,498 WARN L151 SmtUtils]: Spent 338ms on a formula simplification. DAG size of input: 105 DAG size of output 103
[2018-04-11 20:37:28,664 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 84 DAG size of output 70
[2018-04-11 20:37:28,913 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 83 DAG size of output 69
[2018-04-11 20:37:29,232 WARN L151 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 91 DAG size of output 77
[2018-04-11 20:37:29,601 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 106 DAG size of output 88
[2018-04-11 20:37:30,304 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 80 DAG size of output 70
[2018-04-11 20:37:30,680 WARN L151 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 104 DAG size of output 88
[2018-04-11 20:37:31,211 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 71 DAG size of output 63
[2018-04-11 20:37:31,563 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 103 DAG size of output 87
[2018-04-11 20:37:32,339 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 102 DAG size of output 84
[2018-04-11 20:37:33,027 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 101 DAG size of output 83
[2018-04-11 20:37:33,626 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 100 DAG size of output 82
[2018-04-11 20:37:34,097 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 97 DAG size of output 79
[2018-04-11 20:37:34,797 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 95 DAG size of output 79
[2018-04-11 20:37:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:37:34,826 INFO L93 Difference]: Finished difference Result 337 states and 364 transitions.
[2018-04-11 20:37:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states.
[2018-04-11 20:37:34,826 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 94
[2018-04-11 20:37:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:37:34,827 INFO L225 Difference]: With dead ends: 337
[2018-04-11 20:37:34,828 INFO L226 Difference]: Without dead ends: 336
[2018-04-11 20:37:34,828 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4976 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2787, Invalid=15573, Unknown=0, NotChecked=0, Total=18360
[2018-04-11 20:37:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2018-04-11 20:37:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 256.
[2018-04-11 20:37:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-04-11 20:37:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions.
[2018-04-11 20:37:34,864 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 94
[2018-04-11 20:37:34,864 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:37:34,864 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions.
[2018-04-11 20:37:34,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states.
[2018-04-11 20:37:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions.
[2018-04-11 20:37:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2018-04-11 20:37:34,865 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:37:34,865 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:37:34,865 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:37:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1813950784, now seen corresponding path program 7 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:37:34,871 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:37:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:37:34,905 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:37:34,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:34,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:34,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:37:34,937 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:34,937 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:34,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, 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-11 20:37:34,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,948 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:34,948 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:34,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:37:34,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:37:34,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 14 treesize of output 11
[2018-04-11 20:37:34,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:37:34,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:34,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:37:34,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:37:35,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38
[2018-04-11 20:37:35,699 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:35,700 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:35,701 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:35,701 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:35,702 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:35,702 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:35,712 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 38 treesize of output 93
[2018-04-11 20:37:35,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:35,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:35,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:35,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:106
[2018-04-11 20:37:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:36,337 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:37:37,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51
[2018-04-11 20:37:37,969 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:37,969 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:37,970 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:37,970 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:37,970 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:37,971 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:37:37,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49
[2018-04-11 20:37:37,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:37,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:93
[2018-04-11 20:37:38,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21
[2018-04-11 20:37:38,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,381 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 27 treesize of output 21
[2018-04-11 20:37:38,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,391 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:37:38,404 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 3
[2018-04-11 20:37:38,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:37:38,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3
[2018-04-11 20:37:38,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:38,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:38,445 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:37:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:38,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:37:38,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70
[2018-04-11 20:37:38,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states
[2018-04-11 20:37:38,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2018-04-11 20:37:38,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=4656, Unknown=1, NotChecked=0, Total=4970
[2018-04-11 20:37:38,564 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 71 states.
[2018-04-11 20:37:40,185 WARN L148 SmtUtils]: Spent 408ms on a formula simplification that was a NOOP. DAG size: 58
[2018-04-11 20:37:40,931 WARN L148 SmtUtils]: Spent 410ms on a formula simplification that was a NOOP. DAG size: 58
[2018-04-11 20:37:41,625 WARN L151 SmtUtils]: Spent 556ms on a formula simplification. DAG size of input: 117 DAG size of output 73
[2018-04-11 20:37:42,830 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 89 DAG size of output 88
[2018-04-11 20:37:43,161 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 90 DAG size of output 89
[2018-04-11 20:37:43,932 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 102 DAG size of output 101
[2018-04-11 20:37:44,956 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 94 DAG size of output 93
[2018-04-11 20:37:45,350 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 92 DAG size of output 91
[2018-04-11 20:37:45,902 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 107 DAG size of output 106
[2018-04-11 20:37:46,439 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 127 DAG size of output 113
[2018-04-11 20:37:46,755 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 120 DAG size of output 106
[2018-04-11 20:37:47,611 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 97 DAG size of output 88
[2018-04-11 20:37:47,870 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 107 DAG size of output 92
[2018-04-11 20:37:48,465 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 106 DAG size of output 94
[2018-04-11 20:37:48,853 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 90 DAG size of output 81
[2018-04-11 20:37:49,130 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 110 DAG size of output 102
[2018-04-11 20:37:49,685 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 98 DAG size of output 87
[2018-04-11 20:37:50,776 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 114 DAG size of output 94
[2018-04-11 20:37:52,050 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 110 DAG size of output 90
[2018-04-11 20:37:53,098 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 106 DAG size of output 88
[2018-04-11 20:37:54,004 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 102 DAG size of output 88
[2018-04-11 20:37:54,896 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 98 DAG size of output 89
[2018-04-11 20:37:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:37:55,036 INFO L93 Difference]: Finished difference Result 453 states and 476 transitions.
[2018-04-11 20:37:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states.
[2018-04-11 20:37:55,037 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 97
[2018-04-11 20:37:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:37:55,038 INFO L225 Difference]: With dead ends: 453
[2018-04-11 20:37:55,038 INFO L226 Difference]: Without dead ends: 452
[2018-04-11 20:37:55,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=2336, Invalid=29169, Unknown=1, NotChecked=0, Total=31506
[2018-04-11 20:37:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2018-04-11 20:37:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 274.
[2018-04-11 20:37:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states.
[2018-04-11 20:37:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 295 transitions.
[2018-04-11 20:37:55,073 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 295 transitions. Word has length 97
[2018-04-11 20:37:55,073 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:37:55,073 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 295 transitions.
[2018-04-11 20:37:55,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states.
[2018-04-11 20:37:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 295 transitions.
[2018-04-11 20:37:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2018-04-11 20:37:55,074 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:37:55,074 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:37:55,074 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:37:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1290114054, now seen corresponding path program 8 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:37:55,082 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:37:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:37:55,122 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:37:55,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:55,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:37:55,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:37:55,213 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:55,214 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:55,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:37:55,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,221 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:37:55,221 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-11 20:37:55,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:37:55,246 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 14 treesize of output 11
[2018-04-11 20:37:55,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:37:55,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:55,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:37:55,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:37:55,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2018-04-11 20:37:55,308 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 14 treesize of output 11
[2018-04-11 20:37:55,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:55,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:55,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:55,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46
[2018-04-11 20:37:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:55,982 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:37:57,284 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 13 treesize of output 11
[2018-04-11 20:37:57,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2018-04-11 20:37:57,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45
[2018-04-11 20:37:57,614 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 27 treesize of output 21
[2018-04-11 20:37:57,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:37:57,642 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 3
[2018-04-11 20:37:57,642 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,660 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30
[2018-04-11 20:37:57,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3
[2018-04-11 20:37:57,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13
[2018-04-11 20:37:57,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:37:57,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:37:57,708 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:37:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:37:57,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:37:57,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68
[2018-04-11 20:37:57,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states
[2018-04-11 20:37:57,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants.
[2018-04-11 20:37:57,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4438, Unknown=0, NotChecked=0, Total=4692
[2018-04-11 20:37:57,836 INFO L87 Difference]: Start difference. First operand 274 states and 295 transitions. Second operand 69 states.
[2018-04-11 20:37:59,462 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 58 DAG size of output 57
[2018-04-11 20:38:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:38:08,392 INFO L93 Difference]: Finished difference Result 444 states and 470 transitions.
[2018-04-11 20:38:08,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states.
[2018-04-11 20:38:08,422 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 98
[2018-04-11 20:38:08,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:38:08,423 INFO L225 Difference]: With dead ends: 444
[2018-04-11 20:38:08,423 INFO L226 Difference]: Without dead ends: 443
[2018-04-11 20:38:08,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7699 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2006, Invalid=28794, Unknown=0, NotChecked=0, Total=30800
[2018-04-11 20:38:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states.
[2018-04-11 20:38:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 274.
[2018-04-11 20:38:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states.
[2018-04-11 20:38:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 295 transitions.
[2018-04-11 20:38:08,465 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 295 transitions. Word has length 98
[2018-04-11 20:38:08,465 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:38:08,466 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 295 transitions.
[2018-04-11 20:38:08,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states.
[2018-04-11 20:38:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 295 transitions.
[2018-04-11 20:38:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2018-04-11 20:38:08,467 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:38:08,467 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 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]
[2018-04-11 20:38:08,467 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:38:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash 717612218, now seen corresponding path program 9 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:38:08,476 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:38:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:38:08,517 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:38:08,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:38:08,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:38:08,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:38:08,585 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:08,586 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:08,587 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-11 20:38:08,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,598 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:08,599 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:08,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:38:08,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:38:08,628 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 14 treesize of output 11
[2018-04-11 20:38:08,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:38:08,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:08,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:38:08,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:38:09,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54
[2018-04-11 20:38:09,999 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:09,999 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,000 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,001 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,001 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,003 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,004 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,004 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,005 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,006 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,006 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,007 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,008 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,008 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,009 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:10,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 187
[2018-04-11 20:38:10,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:10,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:10,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:10,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:150
[2018-04-11 20:38:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:38:10,667 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:38:12,712 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 89 treesize of output 77
[2018-04-11 20:38:12,761 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,761 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,762 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,762 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,762 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,763 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,763 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,763 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,763 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,764 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,764 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,764 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,765 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,765 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,765 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:12,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 114
[2018-04-11 20:38:12,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:12,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:12,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:12,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:125
[2018-04-11 20:38:13,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30
[2018-04-11 20:38:13,237 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 3
[2018-04-11 20:38:13,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:13,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:13,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13
[2018-04-11 20:38:13,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:13,270 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 27 treesize of output 21
[2018-04-11 20:38:13,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:13,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:38:13,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, 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 3
[2018-04-11 20:38:13,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:13,300 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:13,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:13,310 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:38:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:38:13,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:38:13,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74
[2018-04-11 20:38:13,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states
[2018-04-11 20:38:13,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants.
[2018-04-11 20:38:13,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=5106, Unknown=2, NotChecked=0, Total=5550
[2018-04-11 20:38:13,456 INFO L87 Difference]: Start difference. First operand 274 states and 295 transitions. Second operand 75 states.
[2018-04-11 20:38:15,998 WARN L151 SmtUtils]: Spent 1222ms on a formula simplification. DAG size of input: 57 DAG size of output 55
[2018-04-11 20:38:16,806 WARN L151 SmtUtils]: Spent 443ms on a formula simplification. DAG size of input: 57 DAG size of output 55
[2018-04-11 20:38:17,064 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 131 DAG size of output 69
[2018-04-11 20:38:19,963 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 101 DAG size of output 97
[2018-04-11 20:38:21,083 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 106 DAG size of output 102
[2018-04-11 20:38:22,306 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 111 DAG size of output 107
[2018-04-11 20:38:22,812 WARN L151 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 143 DAG size of output 122
[2018-04-11 20:38:23,155 WARN L151 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 136 DAG size of output 117
[2018-04-11 20:38:23,753 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 90 DAG size of output 75
[2018-04-11 20:38:24,108 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 109 DAG size of output 94
[2018-04-11 20:38:24,458 WARN L151 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 119 DAG size of output 101
[2018-04-11 20:38:24,647 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 98 DAG size of output 81
[2018-04-11 20:38:24,858 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 102 DAG size of output 84
[2018-04-11 20:38:25,157 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 115 DAG size of output 97
[2018-04-11 20:38:25,672 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 102 DAG size of output 97
[2018-04-11 20:38:26,040 WARN L151 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 122 DAG size of output 111
[2018-04-11 20:38:26,412 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 96 DAG size of output 79
[2018-04-11 20:38:26,692 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 108 DAG size of output 89
[2018-04-11 20:38:27,466 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 97 DAG size of output 88
[2018-04-11 20:38:27,912 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 126 DAG size of output 108
[2018-04-11 20:38:28,645 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 105 DAG size of output 87
[2018-04-11 20:38:29,062 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 82 DAG size of output 74
[2018-04-11 20:38:29,490 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 122 DAG size of output 103
[2018-04-11 20:38:30,168 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 91 DAG size of output 77
[2018-04-11 20:38:30,965 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 121 DAG size of output 99
[2018-04-11 20:38:32,002 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 118 DAG size of output 93
[2018-04-11 20:38:32,718 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 114 DAG size of output 93
[2018-04-11 20:38:33,374 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 110 DAG size of output 92
[2018-04-11 20:38:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:38:33,715 INFO L93 Difference]: Finished difference Result 409 states and 433 transitions.
[2018-04-11 20:38:33,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states.
[2018-04-11 20:38:33,716 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 100
[2018-04-11 20:38:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:38:33,717 INFO L225 Difference]: With dead ends: 409
[2018-04-11 20:38:33,717 INFO L226 Difference]: Without dead ends: 408
[2018-04-11 20:38:33,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10069 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=3433, Invalid=31347, Unknown=2, NotChecked=0, Total=34782
[2018-04-11 20:38:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states.
[2018-04-11 20:38:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 256.
[2018-04-11 20:38:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-04-11 20:38:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions.
[2018-04-11 20:38:33,753 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 100
[2018-04-11 20:38:33,753 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:38:33,753 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions.
[2018-04-11 20:38:33,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states.
[2018-04-11 20:38:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions.
[2018-04-11 20:38:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2018-04-11 20:38:33,754 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:38:33,754 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:38:33,755 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:38:33,755 INFO L82 PathProgramCache]: Analyzing trace with hash -725048268, now seen corresponding path program 10 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:38:33,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:38:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:38:33,797 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:38:33,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:38:33,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:38:33,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:38:33,846 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:33,847 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:33,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:38:33,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,855 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:33,856 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-11 20:38:33,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:38:33,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11
[2018-04-11 20:38:33,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:38:33,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:33,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:38:33,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:38:34,099 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 38 treesize of output 30
[2018-04-11 20:38:34,103 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:34,145 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:34,146 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:34,152 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 1 case distinctions, treesize of input 30 treesize of output 58
[2018-04-11 20:38:34,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:34,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:34,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:34,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84
[2018-04-11 20:38:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:38:34,854 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:38:36,434 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 38
[2018-04-11 20:38:36,456 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:36,456 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:36,457 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:36,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27
[2018-04-11 20:38:36,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77
[2018-04-11 20:38:36,824 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 27 treesize of output 21
[2018-04-11 20:38:36,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,836 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:38:36,849 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 3
[2018-04-11 20:38:36,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,864 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 27 treesize of output 21
[2018-04-11 20:38:36,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:38:36,887 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 3
[2018-04-11 20:38:36,887 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,891 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:36,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:36,901 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:38:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:38:37,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:38:37,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72
[2018-04-11 20:38:37,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states
[2018-04-11 20:38:37,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants.
[2018-04-11 20:38:37,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4965, Unknown=0, NotChecked=0, Total=5256
[2018-04-11 20:38:37,015 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 73 states.
[2018-04-11 20:38:40,913 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 98 DAG size of output 87
[2018-04-11 20:38:42,298 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 89 DAG size of output 86
[2018-04-11 20:38:43,534 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 92 DAG size of output 81
[2018-04-11 20:38:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:38:48,950 INFO L93 Difference]: Finished difference Result 471 states and 495 transitions.
[2018-04-11 20:38:48,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2018-04-11 20:38:48,950 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 101
[2018-04-11 20:38:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:38:48,951 INFO L225 Difference]: With dead ends: 471
[2018-04-11 20:38:48,952 INFO L226 Difference]: Without dead ends: 470
[2018-04-11 20:38:48,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8378 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2156, Invalid=30064, Unknown=0, NotChecked=0, Total=32220
[2018-04-11 20:38:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states.
[2018-04-11 20:38:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 256.
[2018-04-11 20:38:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-04-11 20:38:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions.
[2018-04-11 20:38:48,987 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 101
[2018-04-11 20:38:48,988 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:38:48,988 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions.
[2018-04-11 20:38:48,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states.
[2018-04-11 20:38:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions.
[2018-04-11 20:38:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2018-04-11 20:38:48,988 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:38:48,989 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:38:48,989 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:38:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 35619776, now seen corresponding path program 11 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:38:48,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:38:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:38:49,032 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:38:49,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:38:49,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:38:49,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:38:49,065 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:49,065 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:49,066 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-11 20:38:49,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,076 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:49,077 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:49,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:38:49,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:38:49,102 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 14 treesize of output 11
[2018-04-11 20:38:49,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:38:49,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:49,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:38:49,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:38:49,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22
[2018-04-11 20:38:49,648 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:38:49,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31
[2018-04-11 20:38:49,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:49,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:49,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:49,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66
[2018-04-11 20:38:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:38:50,417 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:38:52,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-04-11 20:38:52,030 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:38:52,032 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12
[2018-04-11 20:38:52,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61
[2018-04-11 20:38:52,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30
[2018-04-11 20:38:52,427 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 3
[2018-04-11 20:38:52,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,445 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 27 treesize of output 21
[2018-04-11 20:38:52,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,457 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:38:52,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3
[2018-04-11 20:38:52,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,475 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13
[2018-04-11 20:38:52,487 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:38:52,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:38:52,496 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:38:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:38:52,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:38:52,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74
[2018-04-11 20:38:52,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states
[2018-04-11 20:38:52,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants.
[2018-04-11 20:38:52,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5259, Unknown=0, NotChecked=0, Total=5550
[2018-04-11 20:38:52,615 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 75 states.
[2018-04-11 20:38:54,307 WARN L148 SmtUtils]: Spent 422ms on a formula simplification that was a NOOP. DAG size: 58
[2018-04-11 20:38:54,844 WARN L148 SmtUtils]: Spent 426ms on a formula simplification that was a NOOP. DAG size: 60
[2018-04-11 20:38:56,181 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 87 DAG size of output 78
[2018-04-11 20:39:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:39:05,772 INFO L93 Difference]: Finished difference Result 441 states and 466 transitions.
[2018-04-11 20:39:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states.
[2018-04-11 20:39:05,773 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 105
[2018-04-11 20:39:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:39:05,774 INFO L225 Difference]: With dead ends: 441
[2018-04-11 20:39:05,774 INFO L226 Difference]: Without dead ends: 440
[2018-04-11 20:39:05,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9192 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2281, Invalid=33629, Unknown=0, NotChecked=0, Total=35910
[2018-04-11 20:39:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states.
[2018-04-11 20:39:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 256.
[2018-04-11 20:39:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-04-11 20:39:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions.
[2018-04-11 20:39:05,812 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 105
[2018-04-11 20:39:05,812 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:39:05,812 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions.
[2018-04-11 20:39:05,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states.
[2018-04-11 20:39:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions.
[2018-04-11 20:39:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2018-04-11 20:39:05,813 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:39:05,813 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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]
[2018-04-11 20:39:05,813 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:39:05,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1937459648, now seen corresponding path program 12 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:39:05,821 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:39:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:39:05,872 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:39:05,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:39:05,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:05,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:39:05,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:05,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:05,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13
[2018-04-11 20:39:05,901 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:05,902 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:05,903 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-11 20:39:05,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:05,912 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:05,913 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:05,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:39:05,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:05,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:05,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13
[2018-04-11 20:39:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:39:06,779 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:39:08,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2018-04-11 20:39:08,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:08,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15
[2018-04-11 20:39:08,668 WARN L307 Elim1Store]: Array PQE input equivalent to true
[2018-04-11 20:39:08,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:08,669 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 3
[2018-04-11 20:39:08,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:08,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:08,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:08,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7
[2018-04-11 20:39:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:39:08,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:39:08,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78
[2018-04-11 20:39:08,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states
[2018-04-11 20:39:08,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants.
[2018-04-11 20:39:08,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=5808, Unknown=0, NotChecked=0, Total=6162
[2018-04-11 20:39:08,785 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 79 states.
[2018-04-11 20:39:18,359 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 98 DAG size of output 90
[2018-04-11 20:39:19,346 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 82 DAG size of output 76
[2018-04-11 20:39:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 20:39:21,011 INFO L93 Difference]: Finished difference Result 500 states and 527 transitions.
[2018-04-11 20:39:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states.
[2018-04-11 20:39:21,012 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 113
[2018-04-11 20:39:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 20:39:21,013 INFO L225 Difference]: With dead ends: 500
[2018-04-11 20:39:21,013 INFO L226 Difference]: Without dead ends: 499
[2018-04-11 20:39:21,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10794 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3787, Invalid=41795, Unknown=0, NotChecked=0, Total=45582
[2018-04-11 20:39:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states.
[2018-04-11 20:39:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 301.
[2018-04-11 20:39:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states.
[2018-04-11 20:39:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions.
[2018-04-11 20:39:21,052 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 113
[2018-04-11 20:39:21,052 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-04-11 20:39:21,052 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions.
[2018-04-11 20:39:21,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states.
[2018-04-11 20:39:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions.
[2018-04-11 20:39:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2018-04-11 20:39:21,053 INFO L347 BasicCegarLoop]: Found error trace
[2018-04-11 20:39:21,053 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 20:39:21,053 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]===
[2018-04-11 20:39:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash 475803904, now seen corresponding path program 13 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 20:39:21,067 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 20:39:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 20:39:21,107 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 20:39:21,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:39:21,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 20:39:21,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-04-11 20:39:21,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 20:39:21,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,151 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,151 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-11 20:39:21,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-04-11 20:39:21,182 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 14 treesize of output 11
[2018-04-11 20:39:21,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-04-11 20:39:21,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:21,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-04-11 20:39:21,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-04-11 20:39:21,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38
[2018-04-11 20:39:21,939 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,940 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,941 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,941 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,942 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,942 INFO L700 Elim1Store]: detected not equals via solver
[2018-04-11 20:39:21,952 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 38 treesize of output 93
[2018-04-11 20:39:21,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-04-11 20:39:21,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:39:22,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:39:22,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:106
[2018-04-11 20:39:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:39:22,938 INFO L314 TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 20:39:25,305 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 59 treesize of output 51
[2018-04-11 20:39:25,335 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:39:25,335 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:39:25,336 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:39:25,336 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:39:25,336 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:39:25,336 INFO L682 Elim1Store]: detected equality via solver
[2018-04-11 20:39:25,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49
[2018-04-11 20:39:25,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:93
[2018-04-11 20:39:25,779 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 27 treesize of output 21
[2018-04-11 20:39:25,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:39:25,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3
[2018-04-11 20:39:25,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,824 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 27 treesize of output 21
[2018-04-11 20:39:25,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,836 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24
[2018-04-11 20:39:25,850 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 3
[2018-04-11 20:39:25,851 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-04-11 20:39:25,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-04-11 20:39:25,866 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21
[2018-04-11 20:39:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 20:39:26,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 20:39:26,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86
[2018-04-11 20:39:26,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states
[2018-04-11 20:39:26,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants.
[2018-04-11 20:39:26,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=7080, Unknown=1, NotChecked=0, Total=7482
[2018-04-11 20:39:26,029 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand 87 states.
[2018-04-11 20:39:31,769 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 97 DAG size of output 96
[2018-04-11 20:39:32,338 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 115 DAG size of output 101
[2018-04-11 20:39:32,655 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 108 DAG size of output 94
[2018-04-11 20:39:33,719 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 90 DAG size of output 80
[2018-04-11 20:39:34,075 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 102 DAG size of output 89
[2018-04-11 20:39:34,791 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 99 DAG size of output 86
[2018-04-11 20:39:35,245 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 82 DAG size of output 79
[2018-04-11 20:39:35,519 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 105 DAG size of output 96
Received shutdown request...
[2018-04-11 20:39:35,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2018-04-11 20:39:35,807 WARN L519 AbstractCegarLoop]: Verification canceled
[2018-04-11 20:39:35,810 WARN L197 ceAbstractionStarter]: Timeout
[2018-04-11 20:39:35,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 08:39:35 BoogieIcfgContainer
[2018-04-11 20:39:35,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-04-11 20:39:35,811 INFO L168 Benchmark]: Toolchain (without parser) took 247780.89 ms. Allocated memory was 296.7 MB in the beginning and 434.6 MB in the end (delta: 137.9 MB). Free memory was 235.4 MB in the beginning and 232.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 140.9 MB. Max. memory is 5.3 GB.
[2018-04-11 20:39:35,812 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 296.7 MB. Free memory is still 259.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-04-11 20:39:35,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.07 ms. Allocated memory is still 296.7 MB. Free memory was 234.4 MB in the beginning and 209.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB.
[2018-04-11 20:39:35,813 INFO L168 Benchmark]: Boogie Preprocessor took 60.93 ms. Allocated memory is still 296.7 MB. Free memory was 209.4 MB in the beginning and 207.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-04-11 20:39:35,813 INFO L168 Benchmark]: RCFGBuilder took 559.60 ms. Allocated memory was 296.7 MB in the beginning and 453.5 MB in the end (delta: 156.8 MB). Free memory was 207.5 MB in the beginning and 387.2 MB in the end (delta: -179.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB.
[2018-04-11 20:39:35,813 INFO L168 Benchmark]: TraceAbstraction took 246837.04 ms. Allocated memory was 453.5 MB in the beginning and 434.6 MB in the end (delta: -18.9 MB). Free memory was 387.2 MB in the beginning and 232.4 MB in the end (delta: 154.8 MB). Peak memory consumption was 136.0 MB. Max. memory is 5.3 GB.
[2018-04-11 20:39:35,815 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.26 ms. Allocated memory is still 296.7 MB. Free memory is still 259.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 318.07 ms. Allocated memory is still 296.7 MB. Free memory was 234.4 MB in the beginning and 209.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 60.93 ms. Allocated memory is still 296.7 MB. Free memory was 209.4 MB in the beginning and 207.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 559.60 ms. Allocated memory was 296.7 MB in the beginning and 453.5 MB in the end (delta: 156.8 MB). Free memory was 207.5 MB in the beginning and 387.2 MB in the end (delta: -179.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 246837.04 ms. Allocated memory was 453.5 MB in the beginning and 434.6 MB in the end (delta: -18.9 MB). Free memory was 387.2 MB in the beginning and 232.4 MB in the end (delta: 154.8 MB). Peak memory consumption was 136.0 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 72 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 151 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 89 locations, 11 error locations. TIMEOUT Result, 246.7s OverallTime, 41 OverallIterations, 10 TraceHistogramMax, 189.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2888 SDtfs, 12680 SDslu, 49527 SDs, 0 SdLazy, 52267 SolverSat, 2336 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 36.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6607 GetRequests, 3710 SyntacticMatches, 41 SemanticMatches, 2855 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 93120 ImplicationChecksByTransitivity, 193.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=40, 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.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 2622 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 54.6s InterpolantComputationTime, 2543 NumberOfCodeBlocks, 2543 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 5004 ConstructedInterpolants, 814 QuantifiedInterpolants, 6874163 SizeOfPredicates, 923 NumberOfNonLiveVariables, 7743 ConjunctsInSsa, 1876 ConjunctsInUnsatCore, 82 InterpolantComputations, 38 PerfectInterpolantSequences, 0/3682 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/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_20-39-35-821.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_20-39-35-821.csv
Completed graceful shutdown