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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-10 00:53:46,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 00:53:46,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 00:53:46,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 00:53:46,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 00:53:46,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 00:53:46,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 00:53:46,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 00:53:46,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 00:53:46,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 00:53:46,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 00:53:46,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 00:53:46,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 00:53:46,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 00:53:46,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 00:53:46,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 00:53:46,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 00:53:46,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 00:53:46,933 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 00:53:46,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 00:53:46,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 00:53:46,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 00:53:46,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 00:53:46,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 00:53:46,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 00:53:46,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 00:53:46,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 00:53:46,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 00:53:46,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 00:53:46,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 00:53:46,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 00:53:46,944 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-10 00:53:46,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 00:53:46,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 00:53:46,969 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-10 00:53:46,969 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-10 00:53:46,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-10 00:53:46,970 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-10 00:53:46,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-10 00:53:46,971 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-10 00:53:46,971 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-10 00:53:46,971 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-10 00:53:46,971 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-10 00:53:46,972 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-10 00:53:46,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 00:53:46,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 00:53:46,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 00:53:46,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 00:53:46,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 00:53:46,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 00:53:46,973 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 00:53:46,973 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-10 00:53:46,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 00:53:46,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 00:53:46,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 00:53:46,974 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-10 00:53:46,974 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-10 00:53:46,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 00:53:46,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 00:53:46,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 00:53:46,975 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 00:53:46,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 00:53:46,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-10 00:53:46,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-10 00:53:46,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 00:53:46,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-10 00:53:46,977 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-10 00:53:46,977 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-10 00:53:46,977 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-10 00:53:46,977 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-10 00:53:47,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 00:53:47,026 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 00:53:47,030 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 00:53:47,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 00:53:47,033 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 00:53:47,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-04-10 00:53:47,383 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcb6ee7459 [2018-04-10 00:53:47,565 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 00:53:47,565 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 00:53:47,565 INFO L168 CDTParser]: Scanning 960521-1_false-valid-free.i [2018-04-10 00:53:47,575 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 00:53:47,576 INFO L215 ultiparseSymbolTable]: [2018-04-10 00:53:47,576 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 00:53:47,576 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_f_________false_valid_free_i__foo ('foo') in 960521-1_false-valid-free.i [2018-04-10 00:53:47,576 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in 960521-1_false-valid-free.i [2018-04-10 00:53:47,576 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 00:53:47,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__caddr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____rlim_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__mode_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__div_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_mutex_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int32_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsblkcnt_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsfilcnt_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_mutexattr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____rlim64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____suseconds_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____time_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ssize_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____dev_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blksize_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int32_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____qaddr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,578 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____caddr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fd_set in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____timer_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____id_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blkcnt64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsfilcnt_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_short in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__key_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int32_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____nlink_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,579 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__blkcnt_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____pthread_list_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_char in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ulong in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int16_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_once_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_long in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__gid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsblkcnt64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____off64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_short in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____quad_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int16_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,580 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__lldiv_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_char in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____mode_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__blksize_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_quad_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__wchar_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____intptr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint32_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_barrier_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__size_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__off_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_attr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__uid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,581 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____socklen_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____clockid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__quad_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____daddr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_spinlock_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int16_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_cond_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,582 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____key_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blkcnt_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____clock_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fd_mask in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__dev_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____WAIT_STATUS in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ushort in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__id_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,583 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint8_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__uint in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____sigset_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__loff_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ino_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ino64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____pid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____off_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fd_mask in 960521-1_false-valid-free.i [2018-04-10 00:53:47,584 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint16_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____gid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__nlink_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__clock_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_condattr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_rwlockattr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_long in 960521-1_false-valid-free.i [2018-04-10 00:53:47,585 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__suseconds_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int8_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____loff_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__daddr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____sig_atomic_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__clockid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__timer_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int8_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_barrierattr_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__register_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__sigset_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____swblk_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_quad_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ldiv_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uid_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ssize_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsblkcnt_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int8_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__n in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsfilcnt64_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ino_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_int in 960521-1_false-valid-free.i [2018-04-10 00:53:47,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____useconds_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__a in 960521-1_false-valid-free.i [2018-04-10 00:53:47,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__b in 960521-1_false-valid-free.i [2018-04-10 00:53:47,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__time_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_rwlock_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_key_t in 960521-1_false-valid-free.i [2018-04-10 00:53:47,605 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcb6ee7459 [2018-04-10 00:53:47,610 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 00:53:47,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-10 00:53:47,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 00:53:47,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 00:53:47,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 00:53:47,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:47,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4180e8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47, skipping insertion in model container [2018-04-10 00:53:47,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:47,636 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 00:53:47,668 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 00:53:47,837 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 00:53:47,883 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 00:53:47,892 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-10 00:53:47,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47 WrapperNode [2018-04-10 00:53:47,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 00:53:47,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 00:53:47,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 00:53:47,946 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 00:53:47,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:47,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:47,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:47,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:47,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:47,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:48,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (1/1) ... [2018-04-10 00:53:48,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 00:53:48,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 00:53:48,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 00:53:48,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 00:53:48,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (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-10 00:53:48,131 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 00:53:48,131 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 00:53:48,131 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_________false_valid_free_i__foo [2018-04-10 00:53:48,131 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 00:53:48,131 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 00:53:48,132 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 00:53:48,132 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 00:53:48,132 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 00:53:48,132 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 00:53:48,132 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 00:53:48,132 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 00:53:48,132 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 00:53:48,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 00:53:48,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 00:53:48,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 00:53:48,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 00:53:48,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 00:53:48,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 00:53:48,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 00:53:48,134 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 00:53:48,134 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 00:53:48,134 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 00:53:48,134 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 00:53:48,134 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 00:53:48,134 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 00:53:48,135 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 00:53:48,135 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 00:53:48,135 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 00:53:48,135 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 00:53:48,135 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 00:53:48,135 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 00:53:48,136 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 00:53:48,136 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 00:53:48,136 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 00:53:48,136 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 00:53:48,136 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 00:53:48,136 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 00:53:48,136 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 00:53:48,137 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 00:53:48,138 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 00:53:48,139 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 00:53:48,140 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 00:53:48,141 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 00:53:48,142 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 00:53:48,142 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 00:53:48,142 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 00:53:48,142 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 00:53:48,142 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 00:53:48,142 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 00:53:48,142 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 00:53:48,143 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_________false_valid_free_i__foo [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 00:53:48,144 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 00:53:48,145 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 00:53:48,145 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 00:53:48,145 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 00:53:48,145 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 00:53:48,145 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 00:53:48,145 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 00:53:48,502 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 00:53:48,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 12:53:48 BoogieIcfgContainer [2018-04-10 00:53:48,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 00:53:48,503 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-10 00:53:48,503 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-10 00:53:48,504 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-10 00:53:48,507 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 12:53:48" (1/1) ... [2018-04-10 00:53:48,515 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-10 00:53:48,515 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-10 00:53:48,533 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-10 00:53:48,554 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-10 00:53:48,568 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 6 location literals (each corresponds to one heap write) [2018-04-10 00:53:48,579 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-10 00:53:48,596 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-10 00:53:48,597 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) : |mll_L634''_1| (Store [2] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1)) : mll_L625_3 (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) : mll_L625_2 (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) : mll_L627_4 (Store [5] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))) : mll_L627_5 (Store [0] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.offset_3|) : |mll_L634''_0| [2018-04-10 00:53:48,599 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: (SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') : |v_main_#t~post4.offset_3| : (Store [0] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.offset_3|) (SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') : |v_main_#t~post4.base_3| : (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) : v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1 : (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) : (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1) : (Store [2] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1)) (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) : v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3 : (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) : (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15)) : (Store [5] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))) [2018-04-10 00:53:48,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-10 00:55:48,900 INFO L314 AbstractInterpreter]: Visited 79 different actions 251 times. Merged at 44 different actions 136 times. Never widened. Found 6 fixpoints after 5 different actions. Largest state had 40 variables. [2018-04-10 00:55:48,902 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-10 00:55:48,909 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-04-10 00:55:48,909 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-10 00:55:48,909 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-10 00:55:48,910 INFO L437 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625)) ((select |v_#memory_int_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627)) ((select |v_#memory_int_6| |v_main_#t~post4.base_3|), at (SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'')) ((select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + -4, 4); srcloc: L635')) [2018-04-10 00:55:48,993 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:48,993 DEBUG L264 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) [2018-04-10 00:55:48,993 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:48,993 DEBUG L266 HeapPartitionManager]: (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) [2018-04-10 00:55:48,993 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 0 [2018-04-10 00:55:48,994 DEBUG L268 HeapPartitionManager]: at array read ((select |v_#memory_int_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625)). [2018-04-10 00:55:48,994 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:48,994 DEBUG L264 HeapPartitionManager]: (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) [2018-04-10 00:55:48,994 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:48,994 DEBUG L266 HeapPartitionManager]: (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) [2018-04-10 00:55:48,994 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 0 [2018-04-10 00:55:48,994 DEBUG L268 HeapPartitionManager]: at array read ((select |v_#memory_int_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625)). [2018-04-10 00:55:49,246 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:49,247 DEBUG L264 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) [2018-04-10 00:55:49,247 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:49,247 DEBUG L266 HeapPartitionManager]: (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) [2018-04-10 00:55:49,247 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 0 [2018-04-10 00:55:49,247 DEBUG L268 HeapPartitionManager]: at array read ((select |v_#memory_int_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627)). [2018-04-10 00:55:49,247 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:49,248 DEBUG L264 HeapPartitionManager]: (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) [2018-04-10 00:55:49,248 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:49,248 DEBUG L266 HeapPartitionManager]: (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) [2018-04-10 00:55:49,248 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 0 [2018-04-10 00:55:49,248 DEBUG L268 HeapPartitionManager]: at array read ((select |v_#memory_int_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627)). [2018-04-10 00:55:49,362 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:49,362 DEBUG L264 HeapPartitionManager]: (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) [2018-04-10 00:55:49,362 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:49,363 DEBUG L266 HeapPartitionManager]: (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) [2018-04-10 00:55:49,363 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 0 [2018-04-10 00:55:49,363 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + -4, 4); srcloc: L635')). [2018-04-10 00:55:49,363 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:49,363 DEBUG L264 HeapPartitionManager]: (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) [2018-04-10 00:55:49,363 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:49,363 DEBUG L266 HeapPartitionManager]: (Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|) [2018-04-10 00:55:49,363 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 0 [2018-04-10 00:55:49,364 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + -4, 4); srcloc: L635')). [2018-04-10 00:55:49,364 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:49,364 DEBUG L264 HeapPartitionManager]: (Store [5] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))) [2018-04-10 00:55:49,364 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:49,364 DEBUG L266 HeapPartitionManager]: (Store [2] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1)) [2018-04-10 00:55:49,364 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 1 [2018-04-10 00:55:49,364 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + -4, 4); srcloc: L635')). [2018-04-10 00:55:49,364 DEBUG L262 HeapPartitionManager]: merging partition blocks for array group[#memory_int] : [2018-04-10 00:55:49,364 DEBUG L264 HeapPartitionManager]: (Store [0] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.offset_3|) [2018-04-10 00:55:49,364 DEBUG L265 HeapPartitionManager]: and [2018-04-10 00:55:49,364 DEBUG L266 HeapPartitionManager]: (Store [2] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1)) [2018-04-10 00:55:49,364 DEBUG L267 HeapPartitionManager]: because of possible aliasing at dimension 1 [2018-04-10 00:55:49,364 DEBUG L268 HeapPartitionManager]: at array read ((select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + -4, 4); srcloc: L635')). [2018-04-10 00:55:49,365 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_1 [2018-04-10 00:55:49,365 DEBUG L374 HeapPartitionManager]: with contents [(Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|), (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)] [2018-04-10 00:55:49,365 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_1 [2018-04-10 00:55:49,365 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select |v_#memory_int_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625)) [2018-04-10 00:55:49,365 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|), (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)] [2018-04-10 00:55:49,366 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_1 [2018-04-10 00:55:49,366 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select |v_#memory_int_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3), at (SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627)) [2018-04-10 00:55:49,366 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|), (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)] [2018-04-10 00:55:49,366 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-10 00:55:49,366 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-10 00:55:49,366 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-10 00:55:49,366 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select |v_#memory_int_6| |v_main_#t~post4.base_3|), at (SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'')) [2018-04-10 00:55:49,366 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-10 00:55:49,366 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_1 [2018-04-10 00:55:49,366 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + -4, 4); srcloc: L635')) [2018-04-10 00:55:49,366 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|), (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)] [2018-04-10 00:55:49,366 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_0 [2018-04-10 00:55:49,367 DEBUG L374 HeapPartitionManager]: with contents [(Store [2] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1)), (Store [5] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))), (Store [0] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.offset_3|)] [2018-04-10 00:55:49,367 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_0 [2018-04-10 00:55:49,367 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + -4, 4); srcloc: L635')) [2018-04-10 00:55:49,367 DEBUG L325 HeapPartitionManager]: write locations: [(Store [2] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1)), (Store [5] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))), (Store [0] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.offset_3|)] [2018-04-10 00:55:49,367 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-10 00:55:49,367 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-10 00:55:49,367 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-10 00:55:49,367 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-04-10 00:55:49,367 INFO L346 HeapPartitionManager]: # location blocks :2 [2018-04-10 00:55:49,367 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-10 00:55:49,367 DEBUG L356 HeapPartitionManager]: [(Store [1] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.base_3|), (Store [3] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1), (Store [4] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)] [2018-04-10 00:55:49,367 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-10 00:55:49,368 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-10 00:55:49,368 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-04-10 00:55:49,368 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-10 00:55:49,368 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-10 00:55:49,368 DEBUG L356 HeapPartitionManager]: [(Store [2] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__a~0.base, ~__U_MULTI_f_________false_valid_free_i__a~0.offset + ~i~0 * 4, 4); srcloc: L625) with (+ (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8) v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1)), (Store [5] at(SUMMARY for call write~int(-1, ~__U_MULTI_f_________false_valid_free_i__b~0.base, ~__U_MULTI_f_________false_valid_free_i__b~0.offset + ~i~0 * 4, 4); srcloc: L627) with (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))), (Store [0] at(SUMMARY for call write~int(0, #t~post4.base, #t~post4.offset, 4); srcloc: L634'') with |v_main_#t~post4.offset_3|)] [2018-04-10 00:55:49,369 INFO L134 ransitionTransformer]: executing heap partitioning transformation [2018-04-10 00:55:49,372 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,372 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,372 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,372 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,373 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,373 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,373 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,373 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,373 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,373 DEBUG L331 ransitionTransformer]: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] [2018-04-10 00:55:49,373 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,373 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,374 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,374 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,374 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,374 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,374 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,374 DEBUG L331 ransitionTransformer]: Formula: (= v_~__U_MULTI_f_________false_valid_free_i__n~0_4 128) InVars {} OutVars{~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_4} AuxVars[] AssignedVars[~__U_MULTI_f_________false_valid_free_i__n~0] [2018-04-10 00:55:49,374 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,374 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,375 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,375 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_5| (store |v_#valid_6| 0 0)) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid] [2018-04-10 00:55:49,375 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,375 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,375 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,375 DEBUG L331 ransitionTransformer]: Formula: (and (= (select |v_#valid_22| |v_main_#t~malloc2.base_1|) 0) (= |v_main_#t~malloc2.offset_1| 0) (not (= |v_main_#t~malloc2.base_1| 0)) (= |v_#valid_21| (store |v_#valid_22| |v_main_#t~malloc2.base_1| 1)) (= (store |v_#length_6| |v_main_#t~malloc2.base_1| (* 4 v_~__U_MULTI_f_________false_valid_free_i__n~0_5)) |v_#length_5|)) InVars {#length=|v_#length_6|, ~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_5, #valid=|v_#valid_22|} OutVars{main_#t~malloc2.base=|v_main_#t~malloc2.base_1|, #length=|v_#length_5|, ~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_5, #valid=|v_#valid_21|, main_#t~malloc2.offset=|v_main_#t~malloc2.offset_1|} AuxVars[] AssignedVars[main_#t~malloc2.base, #valid, #length, main_#t~malloc2.offset] [2018-04-10 00:55:49,375 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,375 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,376 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,376 DEBUG L331 ransitionTransformer]: Formula: (and (= v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_3 0) (= v_~__U_MULTI_f_________false_valid_free_i__a~0.base_4 0)) InVars {} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_4, ~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_3} AuxVars[] AssignedVars[~__U_MULTI_f_________false_valid_free_i__a~0.offset, ~__U_MULTI_f_________false_valid_free_i__a~0.base] [2018-04-10 00:55:49,376 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,376 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,376 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,376 DEBUG L331 ransitionTransformer]: Formula: (and (= v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_8 |v_main_#t~malloc2.offset_2|) (= v_~__U_MULTI_f_________false_valid_free_i__a~0.base_9 |v_main_#t~malloc2.base_2|)) InVars {main_#t~malloc2.base=|v_main_#t~malloc2.base_2|, main_#t~malloc2.offset=|v_main_#t~malloc2.offset_2|} OutVars{main_#t~malloc2.base=|v_main_#t~malloc2.base_2|, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_9, ~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_8, main_#t~malloc2.offset=|v_main_#t~malloc2.offset_2|} AuxVars[] AssignedVars[~__U_MULTI_f_________false_valid_free_i__a~0.offset, ~__U_MULTI_f_________false_valid_free_i__a~0.base] [2018-04-10 00:55:49,376 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,376 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,376 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,377 DEBUG L331 ransitionTransformer]: Formula: (and (= v_~__U_MULTI_f_________false_valid_free_i__b~0.base_4 0) (= v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_3 0)) InVars {} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_3, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_4} AuxVars[] AssignedVars[~__U_MULTI_f_________false_valid_free_i__b~0.offset, ~__U_MULTI_f_________false_valid_free_i__b~0.base] [2018-04-10 00:55:49,377 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,377 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,377 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,377 DEBUG L331 ransitionTransformer]: Formula: (and (= |v_main_#t~malloc3.offset_1| 0) (= |v_#length_7| (store |v_#length_8| |v_main_#t~malloc3.base_1| (* 4 v_~__U_MULTI_f_________false_valid_free_i__n~0_6))) (not (= 0 |v_main_#t~malloc3.base_1|)) (= 0 (select |v_#valid_24| |v_main_#t~malloc3.base_1|)) (= (store |v_#valid_24| |v_main_#t~malloc3.base_1| 1) |v_#valid_23|)) InVars {#length=|v_#length_8|, ~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_6, #valid=|v_#valid_24|} OutVars{main_#t~malloc3.base=|v_main_#t~malloc3.base_1|, #length=|v_#length_7|, ~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_6, main_#t~malloc3.offset=|v_main_#t~malloc3.offset_1|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[main_#t~malloc3.base, main_#t~malloc3.offset, #valid, #length] [2018-04-10 00:55:49,377 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,377 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,377 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,378 DEBUG L331 ransitionTransformer]: Formula: (= v_~__U_MULTI_f_________false_valid_free_i__n~0_3 0) InVars {} OutVars{~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_3} AuxVars[] AssignedVars[~__U_MULTI_f_________false_valid_free_i__n~0] [2018-04-10 00:55:49,378 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,378 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,378 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,378 DEBUG L331 ransitionTransformer]: Formula: (and (= v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_8 |v_main_#t~malloc3.offset_2|) (= v_~__U_MULTI_f_________false_valid_free_i__b~0.base_9 |v_main_#t~malloc3.base_2|)) InVars {main_#t~malloc3.base=|v_main_#t~malloc3.base_2|, main_#t~malloc3.offset=|v_main_#t~malloc3.offset_2|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_8, main_#t~malloc3.base=|v_main_#t~malloc3.base_2|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_9, main_#t~malloc3.offset=|v_main_#t~malloc3.offset_2|} AuxVars[] AssignedVars[~__U_MULTI_f_________false_valid_free_i__b~0.offset, ~__U_MULTI_f_________false_valid_free_i__b~0.base] [2018-04-10 00:55:49,378 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,378 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,378 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,378 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,379 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,379 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,379 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,379 DEBUG L331 ransitionTransformer]: Formula: (and (= |v_main_#t~post4.base_1| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_10) (= |v_main_#t~post4.offset_1| v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_9)) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_9, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_10} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_9, main_#t~post4.base=|v_main_#t~post4.base_1|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_10, main_#t~post4.offset=|v_main_#t~post4.offset_1|} AuxVars[] AssignedVars[main_#t~post4.base, main_#t~post4.offset] [2018-04-10 00:55:49,379 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,379 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,380 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,380 DEBUG L331 ransitionTransformer]: Formula: (and (= v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_10 (+ |v_main_#t~post4.offset_2| 4)) (= v_~__U_MULTI_f_________false_valid_free_i__b~0.base_11 |v_main_#t~post4.base_2|)) InVars {main_#t~post4.base=|v_main_#t~post4.base_2|, main_#t~post4.offset=|v_main_#t~post4.offset_2|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_10, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_11, main_#t~post4.base=|v_main_#t~post4.base_2|, main_#t~post4.offset=|v_main_#t~post4.offset_2|} AuxVars[] AssignedVars[~__U_MULTI_f_________false_valid_free_i__b~0.offset, ~__U_MULTI_f_________false_valid_free_i__b~0.base] [2018-04-10 00:55:49,380 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,380 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,384 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,385 DEBUG L331 ransitionTransformer]: Formula: (and (= |v_#memory_int_part_locs_1_locs_0_1| (store |v_#memory_int_part_locs_1_locs_0_2| |v_main_#t~post4.base_3| (store (select |v_#memory_int_part_locs_30_locs_0_2| |v_main_#t~post4.base_3|) |v_main_#t~post4.offset_3| 0))) (= 1 (select |v_#valid_25| |v_main_#t~post4.base_3|)) (<= (+ |v_main_#t~post4.offset_3| 4) (select |v_#length_9| |v_main_#t~post4.base_3|)) (<= 0 |v_main_#t~post4.offset_3|)) InVars {#memory_int_part_locs_30_locs_0=|v_#memory_int_part_locs_30_locs_0_2|, #valid=|v_#valid_25|, #length=|v_#length_9|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_2|, main_#t~post4.base=|v_main_#t~post4.base_3|, main_#t~post4.offset=|v_main_#t~post4.offset_3|} OutVars{#memory_int_part_locs_30_locs_0=|v_#memory_int_part_locs_30_locs_0_2|, #valid=|v_#valid_25|, #length=|v_#length_9|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_1|, main_#t~post4.base=|v_main_#t~post4.base_3|, main_#t~post4.offset=|v_main_#t~post4.offset_3|} AuxVars[] AssignedVars[#memory_int_part_locs_1_locs_0] [2018-04-10 00:55:49,385 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 00:55:49,385 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 00:55:49,385 DEBUG L340 ransitionTransformer]: (and (= 1 (select |v_#valid_25| |v_main_#t~post4.base_3|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_main_#t~post4.base_3| (store (select |v_#memory_int_6| |v_main_#t~post4.base_3|) |v_main_#t~post4.offset_3| 0))) (<= (+ |v_main_#t~post4.offset_3| 4) (select |v_#length_9| |v_main_#t~post4.base_3|)) (<= 0 |v_main_#t~post4.offset_3|)) [2018-04-10 00:55:49,385 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 00:55:49,386 DEBUG L342 ransitionTransformer]: (and (= |v_#memory_int_part_locs_1_locs_0_1| (store |v_#memory_int_part_locs_1_locs_0_2| |v_main_#t~post4.base_3| (store (select |v_#memory_int_part_locs_30_locs_0_2| |v_main_#t~post4.base_3|) |v_main_#t~post4.offset_3| 0))) (= 1 (select |v_#valid_25| |v_main_#t~post4.base_3|)) (<= (+ |v_main_#t~post4.offset_3| 4) (select |v_#length_9| |v_main_#t~post4.base_3|)) (<= 0 |v_main_#t~post4.offset_3|)) [2018-04-10 00:55:49,386 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 00:55:49,386 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 00:55:49,386 DEBUG L348 ransitionTransformer]: {#valid=|v_#valid_25|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, main_#t~post4.base=|v_main_#t~post4.base_3|, main_#t~post4.offset=|v_main_#t~post4.offset_3|} [2018-04-10 00:55:49,386 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 00:55:49,386 DEBUG L350 ransitionTransformer]: {#memory_int_part_locs_30_locs_0=|v_#memory_int_part_locs_30_locs_0_2|, #valid=|v_#valid_25|, #length=|v_#length_9|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_2|, main_#t~post4.base=|v_main_#t~post4.base_3|, main_#t~post4.offset=|v_main_#t~post4.offset_3|} [2018-04-10 00:55:49,386 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,387 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,387 DEBUG L356 ransitionTransformer]: {#valid=|v_#valid_25|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, main_#t~post4.base=|v_main_#t~post4.base_3|, main_#t~post4.offset=|v_main_#t~post4.offset_3|} [2018-04-10 00:55:49,387 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,387 DEBUG L358 ransitionTransformer]: {#memory_int_part_locs_30_locs_0=|v_#memory_int_part_locs_30_locs_0_2|, #valid=|v_#valid_25|, #length=|v_#length_9|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_1|, main_#t~post4.base=|v_main_#t~post4.base_3|, main_#t~post4.offset=|v_main_#t~post4.offset_3|} [2018-04-10 00:55:49,387 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,388 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,388 DEBUG L331 ransitionTransformer]: Formula: (not (= (select |v_#valid_26| |v_main_#t~post4.base_4|) 1)) InVars {main_#t~post4.base=|v_main_#t~post4.base_4|, #valid=|v_#valid_26|} OutVars{main_#t~post4.base=|v_main_#t~post4.base_4|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,388 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,388 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,388 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,388 DEBUG L331 ransitionTransformer]: Formula: (or (not (<= (+ |v_main_#t~post4.offset_4| 4) (select |v_#length_10| |v_main_#t~post4.base_5|))) (not (<= 0 |v_main_#t~post4.offset_4|))) InVars {#length=|v_#length_10|, main_#t~post4.base=|v_main_#t~post4.base_5|, main_#t~post4.offset=|v_main_#t~post4.offset_4|} OutVars{#length=|v_#length_10|, main_#t~post4.base=|v_main_#t~post4.base_5|, main_#t~post4.offset=|v_main_#t~post4.offset_4|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,389 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,389 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,389 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,389 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,389 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,389 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,389 DEBUG L356 ransitionTransformer]: {main_#t~post4.base=|v_main_#t~post4.base_6|, main_#t~post4.offset=|v_main_#t~post4.offset_5|} [2018-04-10 00:55:49,390 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,390 DEBUG L358 ransitionTransformer]: {} [2018-04-10 00:55:49,390 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,390 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,390 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,390 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,391 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,391 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,391 DEBUG L331 ransitionTransformer]: Formula: (and (= (select |v_#valid_27| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) 1) (<= 4 v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11) (<= v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (select |v_#length_11| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12)) (= |v_main_#t~mem5_5| (select (select |v_#memory_int_part_locs_1_locs_0_3| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))))) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11, #length=|v_#length_11|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_3|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12, #valid=|v_#valid_27|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11, #valid=|v_#valid_27|, main_#t~mem5=|v_main_#t~mem5_5|, #length=|v_#length_11|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_3|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12} AuxVars[] AssignedVars[main_#t~mem5] [2018-04-10 00:55:49,391 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 00:55:49,392 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 00:55:49,392 DEBUG L340 ransitionTransformer]: (and (= (select |v_#valid_27| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) 1) (<= 4 v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11) (<= v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (select |v_#length_11| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12)) (= |v_main_#t~mem5_5| (select (select |v_#memory_int_9| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))))) [2018-04-10 00:55:49,392 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 00:55:49,392 DEBUG L342 ransitionTransformer]: (and (= (select |v_#valid_27| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) 1) (<= 4 v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11) (<= v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (select |v_#length_11| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12)) (= |v_main_#t~mem5_5| (select (select |v_#memory_int_part_locs_1_locs_0_3| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12) (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11 (- 4))))) [2018-04-10 00:55:49,392 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 00:55:49,392 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 00:55:49,392 DEBUG L348 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12} [2018-04-10 00:55:49,393 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 00:55:49,393 DEBUG L350 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11, #length=|v_#length_11|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_3|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12, #valid=|v_#valid_27|} [2018-04-10 00:55:49,393 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,393 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,393 DEBUG L356 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, main_#t~mem5=|v_main_#t~mem5_5|, #length=|v_#length_11|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12} [2018-04-10 00:55:49,393 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,393 DEBUG L358 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_11, #valid=|v_#valid_27|, main_#t~mem5=|v_main_#t~mem5_5|, #length=|v_#length_11|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_3|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_12} [2018-04-10 00:55:49,394 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,394 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,394 DEBUG L331 ransitionTransformer]: Formula: (not (= (select |v_#valid_28| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_13) 1)) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_13, #valid=|v_#valid_28|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_13, #valid=|v_#valid_28|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,394 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,394 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,395 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,395 DEBUG L331 ransitionTransformer]: Formula: (or (not (<= v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_12 (select |v_#length_12| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_14))) (not (<= 4 v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_12))) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_12, #length=|v_#length_12|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_14} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_12, #length=|v_#length_12|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_14} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,395 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,395 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,395 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,395 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,395 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,396 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,396 DEBUG L356 ransitionTransformer]: {__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_1} [2018-04-10 00:55:49,396 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,396 DEBUG L358 ransitionTransformer]: {} [2018-04-10 00:55:49,396 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,396 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,396 DEBUG L331 ransitionTransformer]: Formula: (not (= |v_main_#t~mem5_1| 0)) InVars {main_#t~mem5=|v_main_#t~mem5_1|} OutVars{main_#t~mem5=|v_main_#t~mem5_1|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,396 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,396 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,397 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,397 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#t~mem5_3| 0) InVars {main_#t~mem5=|v_main_#t~mem5_3|} OutVars{main_#t~mem5=|v_main_#t~mem5_3|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,397 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,397 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,397 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,397 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_f_________false_valid_free_i__foo_~i~0_2 0) InVars {} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_2} AuxVars[] AssignedVars[__U_MULTI_f_________false_valid_free_i__foo_~i~0] [2018-04-10 00:55:49,397 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,397 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,397 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,397 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,397 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,398 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,398 DEBUG L356 ransitionTransformer]: {main_#t~mem5=|v_main_#t~mem5_2|} [2018-04-10 00:55:49,398 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,398 DEBUG L358 ransitionTransformer]: {} [2018-04-10 00:55:49,398 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,398 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,398 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,398 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,398 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,398 DEBUG L356 ransitionTransformer]: {main_#t~mem5=|v_main_#t~mem5_4|} [2018-04-10 00:55:49,398 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,398 DEBUG L358 ransitionTransformer]: {} [2018-04-10 00:55:49,399 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,399 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,399 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,399 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,399 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,399 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,399 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,399 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,399 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,399 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,399 DEBUG L331 ransitionTransformer]: Formula: (not (= 0 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_4)) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_4} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_4} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,400 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,400 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,400 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,400 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,400 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,400 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,400 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,400 DEBUG L331 ransitionTransformer]: Formula: (not (= 0 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_6)) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_6} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_6} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,400 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,400 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,401 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,401 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,401 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,401 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,401 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,401 DEBUG L331 ransitionTransformer]: Formula: (not (< v___U_MULTI_f_________false_valid_free_i__foo_~i~0_6 v_~__U_MULTI_f_________false_valid_free_i__n~0_1)) InVars {~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_1, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_6} OutVars{~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_1, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_6} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,401 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,401 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,401 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,402 DEBUG L331 ransitionTransformer]: Formula: (< v___U_MULTI_f_________false_valid_free_i__foo_~i~0_7 v_~__U_MULTI_f_________false_valid_free_i__n~0_2) InVars {~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_2, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_7} OutVars{~__U_MULTI_f_________false_valid_free_i__n~0=v_~__U_MULTI_f_________false_valid_free_i__n~0_2, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_7} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,402 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,402 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,402 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,402 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_f_________false_valid_free_i__foo_~i~0_12 0) InVars {} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_12} AuxVars[] AssignedVars[__U_MULTI_f_________false_valid_free_i__foo_~i~0] [2018-04-10 00:55:49,402 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,402 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,402 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,402 DEBUG L331 ransitionTransformer]: Formula: (and (not (= v_~__U_MULTI_f_________false_valid_free_i__a~0.base_5 0)) (not (= (select |v_#valid_7| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_5) 1))) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_5, #valid=|v_#valid_7|} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_5, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,403 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,403 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,403 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,403 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,403 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,403 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,403 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,403 DEBUG L331 ransitionTransformer]: Formula: (and (not (= v_~__U_MULTI_f_________false_valid_free_i__a~0.base_7 0)) (not (= (select |v_#valid_13| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_7) 1))) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_7, #valid=|v_#valid_13|} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_7, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,403 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,403 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,404 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,404 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,404 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,404 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,404 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,405 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse1 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8))) (let ((.cse0 (+ .cse1 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1))) (and (= |v_#memory_int_part_locs_1_locs_0_4| (store |v_#memory_int_part_locs_1_locs_0_5| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1 (store (select |v_#memory_int_part_locs_1_locs_0_5| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) .cse0 (- 1)))) (<= (+ .cse1 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1 4) (select |v_#length_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1)) (<= 0 .cse0) (= 1 (select |v_#valid_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1))))) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1, #valid=|v_#valid_2|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1, #length=|v_#length_2|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_5|} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1, #valid=|v_#valid_2|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1, #length=|v_#length_2|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_4|} AuxVars[] AssignedVars[#memory_int_part_locs_1_locs_0] [2018-04-10 00:55:49,405 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 00:55:49,405 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 00:55:49,405 DEBUG L340 ransitionTransformer]: (let ((.cse0 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8))) (let ((.cse1 (+ .cse0 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1))) (and (<= (+ .cse0 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1 4) (select |v_#length_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1 (store (select |v_#memory_int_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) .cse1 (- 1)))) (<= 0 .cse1) (= 1 (select |v_#valid_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1))))) [2018-04-10 00:55:49,405 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 00:55:49,405 DEBUG L342 ransitionTransformer]: (let ((.cse1 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8))) (let ((.cse0 (+ .cse1 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1))) (and (= |v_#memory_int_part_locs_1_locs_0_4| (store |v_#memory_int_part_locs_1_locs_0_5| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1 (store (select |v_#memory_int_part_locs_1_locs_0_5| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1) .cse0 (- 1)))) (<= (+ .cse1 v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1 4) (select |v_#length_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1)) (<= 0 .cse0) (= 1 (select |v_#valid_2| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1))))) [2018-04-10 00:55:49,405 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 00:55:49,406 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 00:55:49,406 DEBUG L348 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_2|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1, #length=|v_#length_2|} [2018-04-10 00:55:49,406 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 00:55:49,406 DEBUG L350 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1, #valid=|v_#valid_2|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1, #length=|v_#length_2|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_5|} [2018-04-10 00:55:49,406 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,406 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,406 DEBUG L356 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_1|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1, #length=|v_#length_2|} [2018-04-10 00:55:49,406 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,406 DEBUG L358 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_1, #valid=|v_#valid_2|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_8, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_1, #length=|v_#length_2|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_4|} [2018-04-10 00:55:49,406 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,406 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,407 DEBUG L331 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_3| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_2))) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_2, #valid=|v_#valid_3|} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_2, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,407 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,407 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,407 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,407 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_9))) (or (not (<= (+ v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_2 .cse0 4) (select |v_#length_3| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_3))) (not (<= 0 (+ v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_2 .cse0))))) InVars {__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_9, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_3, #length=|v_#length_3|, ~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_2} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_9, ~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_3, #length=|v_#length_3|, ~__U_MULTI_f_________false_valid_free_i__a~0.offset=v_~__U_MULTI_f_________false_valid_free_i__a~0.offset_2} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,407 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,407 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,407 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,408 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,408 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,408 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,408 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,408 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,408 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,408 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,408 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,408 DEBUG L331 ransitionTransformer]: Formula: (= (store |v_#valid_9| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_6 0) |v_#valid_8|) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_6, #valid=|v_#valid_9|} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_6, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid] [2018-04-10 00:55:49,408 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,409 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,409 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,409 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_14| (store |v_#valid_15| v_~__U_MULTI_f_________false_valid_free_i__a~0.base_8 0)) InVars {~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_8, #valid=|v_#valid_15|} OutVars{~__U_MULTI_f_________false_valid_free_i__a~0.base=v_~__U_MULTI_f_________false_valid_free_i__a~0.base_8, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#valid] [2018-04-10 00:55:49,409 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,409 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,409 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,409 DEBUG L331 ransitionTransformer]: Formula: (= |v___U_MULTI_f_________false_valid_free_i__foo_#t~post0_1| v___U_MULTI_f_________false_valid_free_i__foo_~i~0_10) InVars {__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_10} OutVars{__U_MULTI_f_________false_valid_free_i__foo_#t~post0=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post0_1|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_10} AuxVars[] AssignedVars[__U_MULTI_f_________false_valid_free_i__foo_#t~post0] [2018-04-10 00:55:49,409 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,409 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,409 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,410 DEBUG L331 ransitionTransformer]: Formula: (not (< v___U_MULTI_f_________false_valid_free_i__foo_~i~0_13 127)) InVars {__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_13} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_13} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,410 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,410 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,410 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,410 DEBUG L331 ransitionTransformer]: Formula: (< v___U_MULTI_f_________false_valid_free_i__foo_~i~0_14 127) InVars {__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_14} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_14} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,410 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,410 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,410 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,410 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,410 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,411 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,411 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,411 DEBUG L331 ransitionTransformer]: Formula: (not (= 0 v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_4)) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_4} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_4} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,411 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,411 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,411 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,411 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,411 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,411 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,411 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,411 DEBUG L331 ransitionTransformer]: Formula: (not (= 0 v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_6)) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_6} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_6} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,412 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,412 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,412 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,412 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,412 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,412 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,412 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,413 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_f_________false_valid_free_i__foo_~i~0_11 (+ |v___U_MULTI_f_________false_valid_free_i__foo_#t~post0_2| 1)) InVars {__U_MULTI_f_________false_valid_free_i__foo_#t~post0=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post0_2|} OutVars{__U_MULTI_f_________false_valid_free_i__foo_#t~post0=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post0_2|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_11} AuxVars[] AssignedVars[__U_MULTI_f_________false_valid_free_i__foo_~i~0] [2018-04-10 00:55:49,413 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,413 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,414 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,415 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse1 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))) (let ((.cse0 (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 .cse1))) (and (<= 0 .cse0) (<= (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 .cse1 4) (select |v_#length_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)) (= (select |v_#valid_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) 1) (= |v_#memory_int_part_locs_1_locs_0_6| (store |v_#memory_int_part_locs_1_locs_0_7| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3 (store (select |v_#memory_int_part_locs_1_locs_0_7| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) .cse0 (- 1))))))) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2, #valid=|v_#valid_4|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15, #length=|v_#length_4|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_7|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2, #valid=|v_#valid_4|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15, #length=|v_#length_4|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_6|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3} AuxVars[] AssignedVars[#memory_int_part_locs_1_locs_0] [2018-04-10 00:55:49,415 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 00:55:49,415 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 00:55:49,415 DEBUG L340 ransitionTransformer]: (let ((.cse1 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))) (let ((.cse0 (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 .cse1))) (and (<= 0 .cse0) (<= (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 .cse1 4) (select |v_#length_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)) (= (select |v_#valid_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3 (store (select |v_#memory_int_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) .cse0 (- 1))))))) [2018-04-10 00:55:49,415 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 00:55:49,415 DEBUG L342 ransitionTransformer]: (let ((.cse1 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15))) (let ((.cse0 (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 .cse1))) (and (<= 0 .cse0) (<= (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2 .cse1 4) (select |v_#length_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3)) (= (select |v_#valid_4| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) 1) (= |v_#memory_int_part_locs_1_locs_0_6| (store |v_#memory_int_part_locs_1_locs_0_7| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3 (store (select |v_#memory_int_part_locs_1_locs_0_7| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3) .cse0 (- 1))))))) [2018-04-10 00:55:49,415 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 00:55:49,415 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 00:55:49,415 DEBUG L348 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_4|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15, #length=|v_#length_4|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3} [2018-04-10 00:55:49,416 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 00:55:49,416 DEBUG L350 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2, #valid=|v_#valid_4|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15, #length=|v_#length_4|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_7|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3} [2018-04-10 00:55:49,416 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,416 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,416 DEBUG L356 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_3|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15, #length=|v_#length_4|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3} [2018-04-10 00:55:49,416 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,416 DEBUG L358 ransitionTransformer]: {~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_2, #valid=|v_#valid_4|, __U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_15, #length=|v_#length_4|, #memory_int_part_locs_1_locs_0=|v_#memory_int_part_locs_1_locs_0_6|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_3} [2018-04-10 00:55:49,416 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,416 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,417 DEBUG L331 ransitionTransformer]: Formula: (not (= (select |v_#valid_1| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_1) 1)) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_1, #valid=|v_#valid_1|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_1, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,417 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,417 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,417 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,418 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v___U_MULTI_f_________false_valid_free_i__foo_~i~0_3))) (or (not (<= (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_1 .cse0 4) (select |v_#length_1| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_2))) (not (<= 0 (+ v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_1 .cse0))))) InVars {__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_3, ~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_1, #length=|v_#length_1|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_2} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_3, ~__U_MULTI_f_________false_valid_free_i__b~0.offset=v_~__U_MULTI_f_________false_valid_free_i__b~0.offset_1, #length=|v_#length_1|, ~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_2} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,418 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,418 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,418 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,418 DEBUG L331 ransitionTransformer]: Formula: (and (not (= 0 v_~__U_MULTI_f_________false_valid_free_i__b~0.base_5)) (not (= (select |v_#valid_10| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_5) 1))) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_5, #valid=|v_#valid_10|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_5, #valid=|v_#valid_10|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,418 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,419 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,419 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,419 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,419 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,419 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,419 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,420 DEBUG L331 ransitionTransformer]: Formula: (and (not (= (select |v_#valid_16| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_7) 1)) (not (= 0 v_~__U_MULTI_f_________false_valid_free_i__b~0.base_7))) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_7, #valid=|v_#valid_16|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_7, #valid=|v_#valid_16|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,420 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,420 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,420 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,420 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,420 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,420 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,421 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,421 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,421 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,421 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,421 DEBUG L356 ransitionTransformer]: {__U_MULTI_f_________false_valid_free_i__foo_#t~post0=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post0_3|} [2018-04-10 00:55:49,421 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,421 DEBUG L358 ransitionTransformer]: {} [2018-04-10 00:55:49,422 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,422 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,422 DEBUG L331 ransitionTransformer]: Formula: (= |v___U_MULTI_f_________false_valid_free_i__foo_#t~post1_1| v___U_MULTI_f_________false_valid_free_i__foo_~i~0_4) InVars {__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_4} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_4, __U_MULTI_f_________false_valid_free_i__foo_#t~post1=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post1_1|} AuxVars[] AssignedVars[__U_MULTI_f_________false_valid_free_i__foo_#t~post1] [2018-04-10 00:55:49,422 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,422 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,423 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,423 DEBUG L331 ransitionTransformer]: Formula: (= (store |v_#valid_12| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_6 0) |v_#valid_11|) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_6, #valid=|v_#valid_12|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_6, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#valid] [2018-04-10 00:55:49,423 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,423 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,423 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,423 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_17| (store |v_#valid_18| v_~__U_MULTI_f_________false_valid_free_i__b~0.base_8 0)) InVars {~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_8, #valid=|v_#valid_18|} OutVars{~__U_MULTI_f_________false_valid_free_i__b~0.base=v_~__U_MULTI_f_________false_valid_free_i__b~0.base_8, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#valid] [2018-04-10 00:55:49,424 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,424 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,424 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,424 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_f_________false_valid_free_i__foo_~i~0_5 (+ |v___U_MULTI_f_________false_valid_free_i__foo_#t~post1_2| 1)) InVars {__U_MULTI_f_________false_valid_free_i__foo_#t~post1=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post1_2|} OutVars{__U_MULTI_f_________false_valid_free_i__foo_~i~0=v___U_MULTI_f_________false_valid_free_i__foo_~i~0_5, __U_MULTI_f_________false_valid_free_i__foo_#t~post1=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post1_2|} AuxVars[] AssignedVars[__U_MULTI_f_________false_valid_free_i__foo_~i~0] [2018-04-10 00:55:49,424 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,424 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,425 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,425 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#res_1| 0) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-10 00:55:49,425 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,425 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,425 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,425 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,426 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,426 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,426 DEBUG L356 ransitionTransformer]: {__U_MULTI_f_________false_valid_free_i__foo_#t~post1=|v___U_MULTI_f_________false_valid_free_i__foo_#t~post1_3|} [2018-04-10 00:55:49,426 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,426 DEBUG L358 ransitionTransformer]: {} [2018-04-10 00:55:49,426 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,427 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,427 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_19| |old(#valid)|) InVars {#valid=|v_#valid_19|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_19|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,427 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,427 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,427 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,427 DEBUG L331 ransitionTransformer]: Formula: (not (= |v_#valid_20| |old(#valid)|)) InVars {#valid=|v_#valid_20|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_20|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,427 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,428 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,428 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,428 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,428 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,428 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,428 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,428 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 00:55:49,429 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 00:55:49,429 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,429 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 00:55:49,429 DEBUG L331 ransitionTransformer]: Formula: (= |v_ULTIMATE.start_#t~ret6_2| |v_main_#resOutParam_1|) InVars {main_#res=|v_main_#resOutParam_1|} OutVars{ULTIMATE.start_#t~ret6=|v_ULTIMATE.start_#t~ret6_2|, main_#res=|v_main_#resOutParam_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret6] [2018-04-10 00:55:49,429 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 00:55:49,429 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 00:55:49,430 DEBUG L356 ransitionTransformer]: {ULTIMATE.start_#t~ret6=|v_ULTIMATE.start_#t~ret6_2|} [2018-04-10 00:55:49,430 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 00:55:49,430 DEBUG L358 ransitionTransformer]: {ULTIMATE.start_#t~ret6=|v_ULTIMATE.start_#t~ret6_2|, main_#res=|v_main_#resOutParam_1|} [2018-04-10 00:55:49,430 DEBUG L360 ransitionTransformer]: [2018-04-10 00:55:49,431 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-10 00:55:49,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.04 12:55:49 BasicIcfg [2018-04-10 00:55:49,446 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-10 00:55:49,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 00:55:49,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 00:55:49,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 00:55:49,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 12:53:47" (1/4) ... [2018-04-10 00:55:49,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a74d76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 12:55:49, skipping insertion in model container [2018-04-10 00:55:49,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 12:53:47" (2/4) ... [2018-04-10 00:55:49,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a74d76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 12:55:49, skipping insertion in model container [2018-04-10 00:55:49,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 12:53:48" (3/4) ... [2018-04-10 00:55:49,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a74d76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 12:55:49, skipping insertion in model container [2018-04-10 00:55:49,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.04 12:55:49" (4/4) ... [2018-04-10 00:55:49,454 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-10 00:55:49,463 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 00:55:49,470 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-04-10 00:55:49,500 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 00:55:49,501 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 00:55:49,501 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-10 00:55:49,501 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 00:55:49,501 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 00:55:49,501 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 00:55:49,501 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 00:55:49,501 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 00:55:49,502 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 00:55:49,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 00:55:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-04-10 00:55:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 00:55:49,518 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:49,519 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:55:49,519 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2051012991, 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-10 00:55:49,540 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:49,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:49,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 00:55:49,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:49,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:49,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 00:55:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:49,642 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:55:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:49,680 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 00:55:49,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-10 00:55:49,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 00:55:49,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 00:55:49,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 00:55:49,691 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2018-04-10 00:55:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:55:49,819 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-04-10 00:55:49,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 00:55:49,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 00:55:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:55:49,828 INFO L225 Difference]: With dead ends: 115 [2018-04-10 00:55:49,828 INFO L226 Difference]: Without dead ends: 68 [2018-04-10 00:55:49,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 00:55:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-10 00:55:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-10 00:55:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-10 00:55:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-04-10 00:55:49,860 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 17 [2018-04-10 00:55:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:55:49,861 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-04-10 00:55:49,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 00:55:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-04-10 00:55:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 00:55:49,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:49,861 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:55:49,861 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2051012990, 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-10 00:55:49,869 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:49,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:49,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 00:55:49,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:49,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 00:55:49,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-10 00:55:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:50,052 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:55:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:50,176 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 00:55:50,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-10 00:55:50,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 00:55:50,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 00:55:50,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-10 00:55:50,179 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 10 states. [2018-04-10 00:55:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:55:50,428 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-04-10 00:55:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 00:55:50,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-04-10 00:55:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:55:50,430 INFO L225 Difference]: With dead ends: 68 [2018-04-10 00:55:50,430 INFO L226 Difference]: Without dead ends: 67 [2018-04-10 00:55:50,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-10 00:55:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-10 00:55:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-10 00:55:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-10 00:55:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-04-10 00:55:50,439 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 17 [2018-04-10 00:55:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:55:50,440 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-04-10 00:55:50,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 00:55:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-04-10 00:55:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 00:55:50,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:50,441 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:55:50,441 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1350780126, 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-10 00:55:50,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:50,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:50,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 00:55:50,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 00:55:50,484 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-10 00:55:50,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 00:55:50,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 00:55:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:50,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:55:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:50,548 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 00:55:50,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-10 00:55:50,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 00:55:50,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 00:55:50,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 00:55:50,549 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 4 states. [2018-04-10 00:55:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:55:50,584 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-04-10 00:55:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 00:55:50,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-10 00:55:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:55:50,585 INFO L225 Difference]: With dead ends: 67 [2018-04-10 00:55:50,585 INFO L226 Difference]: Without dead ends: 64 [2018-04-10 00:55:50,586 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-10 00:55:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-10 00:55:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-10 00:55:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-10 00:55:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-04-10 00:55:50,591 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 24 [2018-04-10 00:55:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:55:50,591 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-04-10 00:55:50,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 00:55:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-04-10 00:55:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 00:55:50,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:50,592 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-10 00:55:50,592 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1350780127, 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-10 00:55:50,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:50,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:50,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 00:55:50,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 00:55:50,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-10 00:55:50,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 00:55:50,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 00:55:50,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 00:55:50,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-04-10 00:55:50,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 00:55:50,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-10 00:55:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:50,850 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:55:50,967 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-10 00:55:50,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 19 [2018-04-10 00:55:50,982 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 8 treesize of output 1 [2018-04-10 00:55:50,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:50,986 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-10 00:55:50,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-04-10 00:55:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:51,023 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 00:55:51,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 13 [2018-04-10 00:55:51,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 00:55:51,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 00:55:51,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-04-10 00:55:51,024 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 14 states. [2018-04-10 00:55:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:55:51,512 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-04-10 00:55:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 00:55:51,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-04-10 00:55:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:55:51,513 INFO L225 Difference]: With dead ends: 110 [2018-04-10 00:55:51,513 INFO L226 Difference]: Without dead ends: 73 [2018-04-10 00:55:51,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-04-10 00:55:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-10 00:55:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-04-10 00:55:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-10 00:55:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-04-10 00:55:51,522 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 24 [2018-04-10 00:55:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:55:51,523 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-04-10 00:55:51,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 00:55:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-04-10 00:55:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 00:55:51,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:51,524 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:55:51,524 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -499481079, 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-10 00:55:51,530 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:51,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:51,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 00:55:51,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:51,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:51,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-10 00:55:51,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 00:55:51,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:51,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 00:55:51,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-10 00:55:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:51,679 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:55:52,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 19 [2018-04-10 00:55:52,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-10 00:55:52,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:52,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:52,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:52,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-10 00:55:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:52,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 00:55:52,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-10 00:55:52,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 00:55:52,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 00:55:52,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=189, Unknown=1, NotChecked=0, Total=240 [2018-04-10 00:55:52,114 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 16 states. [2018-04-10 00:55:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:55:52,417 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-04-10 00:55:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 00:55:52,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-04-10 00:55:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:55:52,453 INFO L225 Difference]: With dead ends: 121 [2018-04-10 00:55:52,453 INFO L226 Difference]: Without dead ends: 84 [2018-04-10 00:55:52,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=367, Unknown=1, NotChecked=0, Total=506 [2018-04-10 00:55:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-10 00:55:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-04-10 00:55:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-10 00:55:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-04-10 00:55:52,462 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 30 [2018-04-10 00:55:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:55:52,462 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-04-10 00:55:52,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 00:55:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-04-10 00:55:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 00:55:52,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:52,464 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-04-10 00:55:52,464 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1323274717, now seen corresponding path program 2 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-10 00:55:52,471 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:52,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:52,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 00:55:52,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:52,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:52,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-10 00:55:52,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 00:55:52,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:52,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 00:55:52,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-10 00:55:52,700 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-10 00:55:52,700 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:55:53,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 19 [2018-04-10 00:55:53,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-10 00:55:53,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:53,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:53,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:53,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-10 00:55:53,227 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-10 00:55:53,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 00:55:53,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-04-10 00:55:53,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 00:55:53,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 00:55:53,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=457, Unknown=1, NotChecked=0, Total=552 [2018-04-10 00:55:53,249 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 24 states. [2018-04-10 00:55:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:55:53,898 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-04-10 00:55:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 00:55:53,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-04-10 00:55:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:55:53,900 INFO L225 Difference]: With dead ends: 145 [2018-04-10 00:55:53,900 INFO L226 Difference]: Without dead ends: 108 [2018-04-10 00:55:53,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=364, Invalid=1117, Unknown=1, NotChecked=0, Total=1482 [2018-04-10 00:55:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-10 00:55:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2018-04-10 00:55:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-10 00:55:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-04-10 00:55:53,913 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 42 [2018-04-10 00:55:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:55:53,913 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-04-10 00:55:53,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 00:55:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-04-10 00:55:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 00:55:53,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:53,915 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:55:53,916 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1430171771, now seen corresponding path program 3 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-10 00:55:53,927 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:53,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:53,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 00:55:53,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:53,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:53,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-10 00:55:53,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 00:55:53,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:53,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 00:55:53,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-10 00:55:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:54,460 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:55:55,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-10 00:55:55,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-10 00:55:55,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:55,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:55,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:55,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-10 00:55:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:55,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 00:55:55,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-04-10 00:55:55,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 00:55:55,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 00:55:55,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1327, Unknown=3, NotChecked=0, Total=1560 [2018-04-10 00:55:55,860 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 40 states. [2018-04-10 00:55:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:55:57,942 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2018-04-10 00:55:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 00:55:57,942 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 66 [2018-04-10 00:55:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:55:57,943 INFO L225 Difference]: With dead ends: 193 [2018-04-10 00:55:57,943 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 00:55:57,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1152, Invalid=3815, Unknown=3, NotChecked=0, Total=4970 [2018-04-10 00:55:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 00:55:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2018-04-10 00:55:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-10 00:55:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-04-10 00:55:57,959 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 66 [2018-04-10 00:55:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:55:57,959 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-04-10 00:55:57,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 00:55:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-04-10 00:55:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-10 00:55:57,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:55:57,962 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:55:57,962 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:55:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash 453993173, now seen corresponding path program 4 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-10 00:55:57,968 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:55:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:55:58,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:55:58,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 8 treesize of output 7 [2018-04-10 00:55:58,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:58,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:55:58,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-10 00:55:58,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 00:55:58,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:55:58,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 00:55:58,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-10 00:55:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:55:59,439 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:56:01,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 19 [2018-04-10 00:56:01,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 00:56:01,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:56:01,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:56:01,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:56:01,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-10 00:56:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:56:01,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 00:56:01,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-04-10 00:56:01,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 00:56:01,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 00:56:01,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=4416, Unknown=2, NotChecked=0, Total=5112 [2018-04-10 00:56:01,609 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 72 states. [2018-04-10 00:56:04,635 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 120 DAG size of output 26 [2018-04-10 00:56:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:56:09,656 INFO L93 Difference]: Finished difference Result 289 states and 323 transitions. [2018-04-10 00:56:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 00:56:09,657 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 114 [2018-04-10 00:56:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:56:09,658 INFO L225 Difference]: With dead ends: 289 [2018-04-10 00:56:09,658 INFO L226 Difference]: Without dead ends: 252 [2018-04-10 00:56:09,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=4072, Invalid=14016, Unknown=2, NotChecked=0, Total=18090 [2018-04-10 00:56:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-10 00:56:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 247. [2018-04-10 00:56:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-10 00:56:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 249 transitions. [2018-04-10 00:56:09,678 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 249 transitions. Word has length 114 [2018-04-10 00:56:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:56:09,678 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 249 transitions. [2018-04-10 00:56:09,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 00:56:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 249 transitions. [2018-04-10 00:56:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-04-10 00:56:09,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:56:09,683 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:56:09,683 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:56:09,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1396042101, now seen corresponding path program 5 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-10 00:56:09,689 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:56:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:56:09,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:56:09,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 00:56:09,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:56:09,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:56:09,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-10 00:56:09,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 00:56:09,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:56:09,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 00:56:09,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-10 00:56:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:56:13,367 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:56:18,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 19 [2018-04-10 00:56:18,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-10 00:56:18,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:56:18,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:56:18,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:56:18,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-10 00:56:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:56:18,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 00:56:18,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 135 [2018-04-10 00:56:18,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-04-10 00:56:18,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-04-10 00:56:18,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2390, Invalid=15969, Unknown=1, NotChecked=0, Total=18360 [2018-04-10 00:56:18,706 INFO L87 Difference]: Start difference. First operand 247 states and 249 transitions. Second operand 136 states. [2018-04-10 00:56:27,219 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 147 DAG size of output 22 [2018-04-10 00:56:27,939 WARN L151 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 235 DAG size of output 26 [2018-04-10 00:56:28,620 WARN L151 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 232 DAG size of output 26 [2018-04-10 00:56:29,303 WARN L151 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 229 DAG size of output 27 [2018-04-10 00:56:29,994 WARN L151 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 225 DAG size of output 26 [2018-04-10 00:56:30,656 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 222 DAG size of output 27 [2018-04-10 00:56:31,320 WARN L151 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 218 DAG size of output 26 [2018-04-10 00:56:31,962 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 215 DAG size of output 27 [2018-04-10 00:56:32,600 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 211 DAG size of output 26 [2018-04-10 00:56:33,237 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 208 DAG size of output 27 [2018-04-10 00:56:33,868 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 204 DAG size of output 26 [2018-04-10 00:56:34,484 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 201 DAG size of output 27 [2018-04-10 00:56:35,099 WARN L151 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 197 DAG size of output 26 [2018-04-10 00:56:35,697 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 194 DAG size of output 27 [2018-04-10 00:56:36,302 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 190 DAG size of output 26 [2018-04-10 00:56:36,886 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 187 DAG size of output 27 [2018-04-10 00:56:37,462 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 183 DAG size of output 26 [2018-04-10 00:56:38,032 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 180 DAG size of output 27 [2018-04-10 00:56:38,600 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 176 DAG size of output 26 [2018-04-10 00:56:39,151 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 173 DAG size of output 27 [2018-04-10 00:56:39,699 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 169 DAG size of output 26 [2018-04-10 00:56:40,238 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 166 DAG size of output 27 [2018-04-10 00:56:40,771 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 162 DAG size of output 26 [2018-04-10 00:56:41,293 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 159 DAG size of output 27 [2018-04-10 00:56:41,818 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 155 DAG size of output 26 [2018-04-10 00:56:42,325 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 152 DAG size of output 27 [2018-04-10 00:56:42,829 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 148 DAG size of output 26 [2018-04-10 00:56:43,323 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 145 DAG size of output 27 [2018-04-10 00:56:43,812 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 141 DAG size of output 26 [2018-04-10 00:56:44,283 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 138 DAG size of output 27 [2018-04-10 00:56:44,761 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 134 DAG size of output 26 [2018-04-10 00:56:45,217 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 131 DAG size of output 27 [2018-04-10 00:56:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 00:56:55,529 INFO L93 Difference]: Finished difference Result 481 states and 547 transitions. [2018-04-10 00:56:55,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-10 00:56:55,529 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 210 [2018-04-10 00:56:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 00:56:55,532 INFO L225 Difference]: With dead ends: 481 [2018-04-10 00:56:55,532 INFO L226 Difference]: Without dead ends: 444 [2018-04-10 00:56:55,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13861 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=15288, Invalid=53617, Unknown=1, NotChecked=0, Total=68906 [2018-04-10 00:56:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-10 00:56:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2018-04-10 00:56:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-04-10 00:56:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 441 transitions. [2018-04-10 00:56:55,558 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 441 transitions. Word has length 210 [2018-04-10 00:56:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 00:56:55,559 INFO L459 AbstractCegarLoop]: Abstraction has 439 states and 441 transitions. [2018-04-10 00:56:55,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-04-10 00:56:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 441 transitions. [2018-04-10 00:56:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-04-10 00:56:55,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 00:56:55,567 INFO L355 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 00:56:55,568 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr9AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-10 00:56:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash 212629173, now seen corresponding path program 6 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-10 00:56:55,580 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 00:56:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 00:56:55,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 00:56:55,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 00:56:55,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:56:55,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:56:55,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-10 00:56:55,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 00:56:55,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 00:56:55,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 00:56:55,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-10 00:57:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 0 proven. 11907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:57:08,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 00:57:26,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 19 [2018-04-10 00:57:26,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-10 00:57:26,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 00:57:26,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:57:26,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 00:57:26,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-10 00:57:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 0 proven. 11907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 00:57:27,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 00:57:27,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 263 [2018-04-10 00:57:27,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 264 states [2018-04-10 00:57:27,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2018-04-10 00:57:27,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8854, Invalid=60575, Unknown=3, NotChecked=0, Total=69432 [2018-04-10 00:57:27,496 INFO L87 Difference]: Start difference. First operand 439 states and 441 transitions. Second operand 264 states. Received shutdown request... [2018-04-10 00:57:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-10 00:57:48,641 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 00:57:48,645 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 00:57:48,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 12:57:48 BasicIcfg [2018-04-10 00:57:48,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 00:57:48,647 INFO L168 Benchmark]: Toolchain (without parser) took 241036.05 ms. Allocated memory was 307.2 MB in the beginning and 490.7 MB in the end (delta: 183.5 MB). Free memory was 243.1 MB in the beginning and 366.4 MB in the end (delta: -123.2 MB). Peak memory consumption was 194.5 MB. Max. memory is 5.3 GB. [2018-04-10 00:57:48,647 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 307.2 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 00:57:48,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.46 ms. Allocated memory is still 307.2 MB. Free memory was 243.1 MB in the beginning and 219.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-10 00:57:48,648 INFO L168 Benchmark]: Boogie Preprocessor took 58.90 ms. Allocated memory is still 307.2 MB. Free memory was 219.0 MB in the beginning and 217.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-10 00:57:48,648 INFO L168 Benchmark]: RCFGBuilder took 497.27 ms. Allocated memory was 307.2 MB in the beginning and 449.3 MB in the end (delta: 142.1 MB). Free memory was 217.0 MB in the beginning and 388.0 MB in the end (delta: -171.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-04-10 00:57:48,649 INFO L168 Benchmark]: IcfgTransformer took 120943.34 ms. Allocated memory was 449.3 MB in the beginning and 596.6 MB in the end (delta: 147.3 MB). Free memory was 388.0 MB in the beginning and 483.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 52.3 MB. Max. memory is 5.3 GB. [2018-04-10 00:57:48,649 INFO L168 Benchmark]: TraceAbstraction took 119198.73 ms. Allocated memory was 596.6 MB in the beginning and 490.7 MB in the end (delta: -105.9 MB). Free memory was 483.0 MB in the beginning and 366.4 MB in the end (delta: 116.7 MB). Peak memory consumption was 145.0 MB. Max. memory is 5.3 GB. [2018-04-10 00:57:48,652 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.24 ms. Allocated memory is still 307.2 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 331.46 ms. Allocated memory is still 307.2 MB. Free memory was 243.1 MB in the beginning and 219.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 58.90 ms. Allocated memory is still 307.2 MB. Free memory was 219.0 MB in the beginning and 217.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 497.27 ms. Allocated memory was 307.2 MB in the beginning and 449.3 MB in the end (delta: 142.1 MB). Free memory was 217.0 MB in the beginning and 388.0 MB in the end (delta: -171.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * IcfgTransformer took 120943.34 ms. Allocated memory was 449.3 MB in the beginning and 596.6 MB in the end (delta: 147.3 MB). Free memory was 388.0 MB in the beginning and 483.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 52.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 119198.73 ms. Allocated memory was 596.6 MB in the beginning and 490.7 MB in the end (delta: -105.9 MB). Free memory was 483.0 MB in the beginning and 366.4 MB in the end (delta: 116.7 MB). Peak memory consumption was 145.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 64 LocStat_MAX_WEQGRAPH_SIZE : 10 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 1278 LocStat_NO_SUPPORTING_DISEQUALITIES : 301 LocStat_NO_DISJUNCTIONS : -128 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 85 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 107 TransStat_NO_SUPPORTING_DISEQUALITIES : 22 TransStat_NO_DISJUNCTIONS : 87 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 11467.53 RENAME_VARIABLES(MILLISECONDS) : 398.53 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 11695.88 PROJECTAWAY(MILLISECONDS) : 59391.98 ADD_WEAK_EQUALITY(MILLISECONDS) : 8.72 DISJOIN(MILLISECONDS) : 523.63 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 412.78 ADD_EQUALITY(MILLISECONDS) : 12.03 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.61 #CONJOIN_DISJUNCTIVE : 275 #RENAME_VARIABLES : 552 #UNFREEZE : 0 #CONJOIN : 391 #PROJECTAWAY : 360 #ADD_WEAK_EQUALITY : 21 #DISJOIN : 72 #RENAME_VARIABLES_DISJUNCTIVE : 547 #ADD_EQUALITY : 110 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 20 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 85508.57 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 11686.51 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 8.46 JOIN(MILLISECONDS) : 518.44 RENAMEVARS(MILLISECONDS) : 391.62 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 44657.56 ISLABELSTRONGERTHAN(MILLISECONDS) : 6999.90 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 279.37 UNFREEZE(MILLISECONDS) : 203.04 REPORTCONTAINS(MILLISECONDS) : 0.00 PROJECTAWAY(MILLISECONDS) : 59240.44 MEETEDGELABELS(MILLISECONDS) : 1296.70 REPORTEQUALITY(MILLISECONDS) : 1172.74 ADDALLNODES(MILLISECONDS) : 353.89 REPORTDISEQUALITY(MILLISECONDS) : 3.10 WEQGRAPHJOIN(MILLISECONDS) : 458.81 #FREEZE : 2354 #ADDNODE : 0 #MEET : 275 #FILTERREDUNDANT : 0 #REPORTWEQ : 21 #JOIN : 72 #RENAMEVARS : 552 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 527 #ISLABELSTRONGERTHAN : 545277 #ISWEQGRAPHSTRONGERTHAN : 270 #UNFREEZE : 1754 #REPORTCONTAINS : 0 #PROJECTAWAY : 927 #MEETEDGELABELS : 6778 #REPORTEQUALITY : 4468 #ADDALLNODES : 275 #REPORTDISEQUALITY : 968 #WEQGRAPHJOIN : 72 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 15193.60 REPORT_EQUALITY(MILLISECONDS) : 5492.00 FILTERREDUNDANT(MILLISECONDS) : 77152.57 ADD_ALL_ELEMENTS(MILLISECONDS) : 28217.96 JOIN(MILLISECONDS) : 34.54 ALIGN_ELEMENTS(MILLISECONDS) : 49660.34 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 917.51 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 89390.83 REPORTCONTAINS(MILLISECONDS) : 0.00 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 61595.55 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 2981.74 #ADDNODE : 0 #MEET : 42132 #REPORT_EQUALITY : 780100 #FILTERREDUNDANT : 1130755 #ADD_ALL_ELEMENTS : 1043062 #JOIN : 72 #ALIGN_ELEMENTS : 500532 #COPY : 0 #REPORT_DISEQUALITY : 241423 #UNFREEZE : 0 #OVERALL : 5445937 #REPORTCONTAINS : 0 #IS_STRONGER_THAN_NO_CACHING : 1671051 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 36810 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 4 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 92 states, 264 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 17 error locations. TIMEOUT Result, 119.1s OverallTime, 10 OverallIterations, 64 TraceHistogramMax, 70.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 637 SDtfs, 14875 SDslu, 23716 SDs, 0 SdLazy, 37271 SolverSat, 6755 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2229 GetRequests, 1315 SyntacticMatches, 2 SemanticMatches, 911 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44672 ImplicationChecksByTransitivity, 94.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 48.2s InterpolantComputationTime, 946 NumberOfCodeBlocks, 946 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1872 ConstructedInterpolants, 815 QuantifiedInterpolants, 9650440 SizeOfPredicates, 288 NumberOfNonLiveVariables, 2688 ConjunctsInSsa, 595 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 0/31284 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/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-10_00-57-48-667.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-10_00-57-48-667.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-10_00-57-48-667.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-10_00-57-48-667.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-10_00-57-48-667.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-10_00-57-48-667.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_00-57-48-667.csv Completed graceful shutdown