java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 20:57:14,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 20:57:14,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 20:57:14,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 20:57:14,173 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 20:57:14,174 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 20:57:14,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 20:57:14,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 20:57:14,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 20:57:14,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 20:57:14,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 20:57:14,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 20:57:14,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 20:57:14,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 20:57:14,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 20:57:14,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 20:57:14,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 20:57:14,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 20:57:14,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 20:57:14,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 20:57:14,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 20:57:14,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 20:57:14,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 20:57:14,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 20:57:14,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 20:57:14,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 20:57:14,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 20:57:14,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 20:57:14,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 20:57:14,201 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 20:57:14,202 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 20:57:14,202 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-09 20:57:14,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 20:57:14,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 20:57:14,233 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 20:57:14,233 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 20:57:14,233 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 20:57:14,234 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 20:57:14,234 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 20:57:14,234 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 20:57:14,234 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 20:57:14,234 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 20:57:14,235 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 20:57:14,235 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 20:57:14,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 20:57:14,235 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 20:57:14,235 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 20:57:14,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 20:57:14,236 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 20:57:14,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 20:57:14,236 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 20:57:14,236 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 20:57:14,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 20:57:14,237 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 20:57:14,237 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 20:57:14,237 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 20:57:14,237 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 20:57:14,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 20:57:14,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:57:14,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 20:57:14,238 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 20:57:14,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 20:57:14,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 20:57:14,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 20:57:14,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:14,239 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 20:57:14,240 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 20:57:14,240 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 20:57:14,240 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 20:57:14,240 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 20:57:14,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 20:57:14,286 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 20:57:14,290 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 20:57:14,292 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 20:57:14,292 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 20:57:14,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,637 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2d1fdccaa [2018-04-09 20:57:14,825 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 20:57:14,825 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 20:57:14,826 INFO L168 CDTParser]: Scanning lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,836 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 20:57:14,836 INFO L215 ultiparseSymbolTable]: [2018-04-09 20:57:14,836 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 20:57:14,836 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,836 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,836 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,836 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,849 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,849 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,849 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,849 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,849 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,849 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:14,868 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2d1fdccaa [2018-04-09 20:57:14,872 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 20:57:14,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 20:57:14,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 20:57:14,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 20:57:14,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 20:57:14,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:57:14" (1/1) ... [2018-04-09 20:57:14,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a680c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:14, skipping insertion in model container [2018-04-09 20:57:14,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:57:14" (1/1) ... [2018-04-09 20:57:14,897 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:57:14,930 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:57:15,106 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:57:15,162 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:57:15,171 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-09 20:57:15,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15 WrapperNode [2018-04-09 20:57:15,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 20:57:15,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 20:57:15,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 20:57:15,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 20:57:15,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... [2018-04-09 20:57:15,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... [2018-04-09 20:57:15,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... [2018-04-09 20:57:15,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... [2018-04-09 20:57:15,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... [2018-04-09 20:57:15,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... [2018-04-09 20:57:15,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... [2018-04-09 20:57:15,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 20:57:15,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 20:57:15,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 20:57:15,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 20:57:15,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:57:15,402 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 20:57:15,402 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 20:57:15,402 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-09 20:57:15,402 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-09 20:57:15,402 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 20:57:15,403 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 20:57:15,404 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 20:57:15,405 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 20:57:15,406 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 20:57:15,407 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 20:57:15,408 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 20:57:15,409 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 20:57:15,410 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 20:57:15,411 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 20:57:15,412 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 20:57:15,413 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-09 20:57:15,414 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 20:57:15,414 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 20:57:15,414 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 20:57:15,414 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 20:57:15,414 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 20:57:15,414 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 20:57:15,414 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 20:57:15,934 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 20:57:15,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:57:15 BoogieIcfgContainer [2018-04-09 20:57:15,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 20:57:15,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 20:57:15,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 20:57:15,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 20:57:15,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 08:57:14" (1/3) ... [2018-04-09 20:57:15,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f1adfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:57:15, skipping insertion in model container [2018-04-09 20:57:15,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:15" (2/3) ... [2018-04-09 20:57:15,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f1adfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:57:15, skipping insertion in model container [2018-04-09 20:57:15,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:57:15" (3/3) ... [2018-04-09 20:57:15,943 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-04-09 20:57:15,953 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 20:57:15,962 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-09 20:57:16,013 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 20:57:16,014 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 20:57:16,014 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 20:57:16,014 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 20:57:16,014 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 20:57:16,014 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 20:57:16,015 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 20:57:16,015 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 20:57:16,015 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 20:57:16,016 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 20:57:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-04-09 20:57:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 20:57:16,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:16,045 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:16,045 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash 831500316, 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-09 20:57:16,060 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:16,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:16,150 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-09 20:57:16,150 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:16,179 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-09 20:57:16,221 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:16,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 20:57:16,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-09 20:57:16,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-09 20:57:16,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 20:57:16,243 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2018-04-09 20:57:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:16,275 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-04-09 20:57:16,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-09 20:57:16,276 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-04-09 20:57:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:16,295 INFO L225 Difference]: With dead ends: 153 [2018-04-09 20:57:16,295 INFO L226 Difference]: Without dead ends: 126 [2018-04-09 20:57:16,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 20:57:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-09 20:57:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-09 20:57:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-09 20:57:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2018-04-09 20:57:16,341 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 19 [2018-04-09 20:57:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:16,341 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2018-04-09 20:57:16,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-09 20:57:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2018-04-09 20:57:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 20:57:16,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:16,343 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-09 20:57:16,343 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash -948182125, 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-09 20:57:16,350 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:16,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:16,415 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-09 20:57:16,416 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:16,426 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-09 20:57:16,453 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:16,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:57:16,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:57:16,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:57:16,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:16,456 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 3 states. [2018-04-09 20:57:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:16,473 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2018-04-09 20:57:16,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:57:16,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-09 20:57:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:16,475 INFO L225 Difference]: With dead ends: 150 [2018-04-09 20:57:16,475 INFO L226 Difference]: Without dead ends: 127 [2018-04-09 20:57:16,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-09 20:57:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-04-09 20:57:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-09 20:57:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-04-09 20:57:16,484 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 24 [2018-04-09 20:57:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:16,484 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-04-09 20:57:16,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:57:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-04-09 20:57:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 20:57:16,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:16,485 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:16,485 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash -334951210, 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-09 20:57:16,493 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:16,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:16,568 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-09 20:57:16,568 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:16,595 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-09 20:57:16,627 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:16,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:57:16,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:57:16,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:57:16,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:16,629 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 3 states. [2018-04-09 20:57:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:16,673 INFO L93 Difference]: Finished difference Result 240 states and 276 transitions. [2018-04-09 20:57:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:57:16,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-09 20:57:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:16,676 INFO L225 Difference]: With dead ends: 240 [2018-04-09 20:57:16,677 INFO L226 Difference]: Without dead ends: 219 [2018-04-09 20:57:16,677 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-09 20:57:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-04-09 20:57:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-09 20:57:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 245 transitions. [2018-04-09 20:57:16,709 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 245 transitions. Word has length 26 [2018-04-09 20:57:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:16,710 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 245 transitions. [2018-04-09 20:57:16,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:57:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 245 transitions. [2018-04-09 20:57:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 20:57:16,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:16,712 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:16,712 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash -251404699, 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-09 20:57:16,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:16,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:16,807 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-09 20:57:16,807 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:16,850 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-09 20:57:16,885 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:16,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:57:16,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 20:57:16,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 20:57:16,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-09 20:57:16,887 INFO L87 Difference]: Start difference. First operand 200 states and 245 transitions. Second operand 5 states. [2018-04-09 20:57:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:17,045 INFO L93 Difference]: Finished difference Result 579 states and 711 transitions. [2018-04-09 20:57:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:57:17,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-09 20:57:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:17,049 INFO L225 Difference]: With dead ends: 579 [2018-04-09 20:57:17,050 INFO L226 Difference]: Without dead ends: 394 [2018-04-09 20:57:17,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:57:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-09 20:57:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 314. [2018-04-09 20:57:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-09 20:57:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 396 transitions. [2018-04-09 20:57:17,083 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 396 transitions. Word has length 32 [2018-04-09 20:57:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:17,083 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 396 transitions. [2018-04-09 20:57:17,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 20:57:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 396 transitions. [2018-04-09 20:57:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 20:57:17,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:17,085 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:17,085 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:17,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1668850665, 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-09 20:57:17,099 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:17,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:17,159 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-09 20:57:17,159 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:17,170 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-09 20:57:17,205 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:17,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 20:57:17,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:57:17,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:57:17,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:17,206 INFO L87 Difference]: Start difference. First operand 314 states and 396 transitions. Second operand 3 states. [2018-04-09 20:57:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:17,389 INFO L93 Difference]: Finished difference Result 424 states and 544 transitions. [2018-04-09 20:57:17,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:57:17,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-09 20:57:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:17,394 INFO L225 Difference]: With dead ends: 424 [2018-04-09 20:57:17,394 INFO L226 Difference]: Without dead ends: 412 [2018-04-09 20:57:17,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-09 20:57:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 400. [2018-04-09 20:57:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-09 20:57:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 517 transitions. [2018-04-09 20:57:17,426 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 517 transitions. Word has length 32 [2018-04-09 20:57:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:17,426 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 517 transitions. [2018-04-09 20:57:17,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:57:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 517 transitions. [2018-04-09 20:57:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 20:57:17,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:17,428 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:17,428 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:17,428 INFO L82 PathProgramCache]: Analyzing trace with hash -62843736, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:17,437 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:17,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:17,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:57:17,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:57:17,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:57:17,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:57:17,532 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-09 20:57:17,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:17,538 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-09 20:57:17,559 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:17,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:57:17,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:57:17,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:57:17,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:57:17,560 INFO L87 Difference]: Start difference. First operand 400 states and 517 transitions. Second operand 4 states. [2018-04-09 20:57:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:17,734 INFO L93 Difference]: Finished difference Result 681 states and 882 transitions. [2018-04-09 20:57:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 20:57:17,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-09 20:57:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:17,739 INFO L225 Difference]: With dead ends: 681 [2018-04-09 20:57:17,740 INFO L226 Difference]: Without dead ends: 677 [2018-04-09 20:57:17,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 20:57:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-04-09 20:57:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 646. [2018-04-09 20:57:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-04-09 20:57:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 850 transitions. [2018-04-09 20:57:17,773 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 850 transitions. Word has length 34 [2018-04-09 20:57:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:17,774 INFO L459 AbstractCegarLoop]: Abstraction has 646 states and 850 transitions. [2018-04-09 20:57:17,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:57:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 850 transitions. [2018-04-09 20:57:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 20:57:17,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:17,775 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:17,775 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash -62843735, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:17,782 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:17,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:17,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:57:17,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:57:17,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:57:17,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:57:17,875 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-09 20:57:17,875 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:17,896 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-09 20:57:17,920 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:17,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 20:57:17,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:57:17,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:57:17,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:57:17,921 INFO L87 Difference]: Start difference. First operand 646 states and 850 transitions. Second operand 6 states. [2018-04-09 20:57:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:18,231 INFO L93 Difference]: Finished difference Result 1121 states and 1457 transitions. [2018-04-09 20:57:18,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:57:18,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-09 20:57:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:18,236 INFO L225 Difference]: With dead ends: 1121 [2018-04-09 20:57:18,236 INFO L226 Difference]: Without dead ends: 1117 [2018-04-09 20:57:18,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:57:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-04-09 20:57:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1062. [2018-04-09 20:57:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-04-09 20:57:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1403 transitions. [2018-04-09 20:57:18,281 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1403 transitions. Word has length 34 [2018-04-09 20:57:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:18,281 INFO L459 AbstractCegarLoop]: Abstraction has 1062 states and 1403 transitions. [2018-04-09 20:57:18,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:57:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1403 transitions. [2018-04-09 20:57:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 20:57:18,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:18,283 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:18,283 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash -62566616, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:18,292 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:18,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:18,439 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:18,483 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-09 20:57:18,518 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:18,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2018-04-09 20:57:18,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 20:57:18,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 20:57:18,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:57:18,519 INFO L87 Difference]: Start difference. First operand 1062 states and 1403 transitions. Second operand 11 states. [2018-04-09 20:57:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:18,757 INFO L93 Difference]: Finished difference Result 2575 states and 3451 transitions. [2018-04-09 20:57:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 20:57:18,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-09 20:57:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:18,768 INFO L225 Difference]: With dead ends: 2575 [2018-04-09 20:57:18,768 INFO L226 Difference]: Without dead ends: 1528 [2018-04-09 20:57:18,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:57:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-04-09 20:57:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1434. [2018-04-09 20:57:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-04-09 20:57:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1862 transitions. [2018-04-09 20:57:18,855 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1862 transitions. Word has length 34 [2018-04-09 20:57:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:18,855 INFO L459 AbstractCegarLoop]: Abstraction has 1434 states and 1862 transitions. [2018-04-09 20:57:18,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 20:57:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1862 transitions. [2018-04-09 20:57:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 20:57:18,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:18,857 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:18,857 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash 928594531, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:18,871 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:18,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:18,965 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-09 20:57:18,965 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:19,021 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-09 20:57:19,054 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:19,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 12 [2018-04-09 20:57:19,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:57:19,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:57:19,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:57:19,055 INFO L87 Difference]: Start difference. First operand 1434 states and 1862 transitions. Second operand 12 states. [2018-04-09 20:57:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:19,433 INFO L93 Difference]: Finished difference Result 5249 states and 6837 transitions. [2018-04-09 20:57:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 20:57:19,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-04-09 20:57:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:19,446 INFO L225 Difference]: With dead ends: 5249 [2018-04-09 20:57:19,447 INFO L226 Difference]: Without dead ends: 3830 [2018-04-09 20:57:19,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-04-09 20:57:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2018-04-09 20:57:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 3722. [2018-04-09 20:57:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2018-04-09 20:57:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 4706 transitions. [2018-04-09 20:57:19,575 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 4706 transitions. Word has length 36 [2018-04-09 20:57:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:19,575 INFO L459 AbstractCegarLoop]: Abstraction has 3722 states and 4706 transitions. [2018-04-09 20:57:19,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:57:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 4706 transitions. [2018-04-09 20:57:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 20:57:19,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:19,577 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:19,577 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1185822231, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:19,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:19,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:19,840 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:20,212 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:20,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-09 20:57:20,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:57:20,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:57:20,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:57:20,213 INFO L87 Difference]: Start difference. First operand 3722 states and 4706 transitions. Second operand 9 states. [2018-04-09 20:57:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:20,936 INFO L93 Difference]: Finished difference Result 8449 states and 10773 transitions. [2018-04-09 20:57:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 20:57:20,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-09 20:57:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:20,954 INFO L225 Difference]: With dead ends: 8449 [2018-04-09 20:57:20,954 INFO L226 Difference]: Without dead ends: 4742 [2018-04-09 20:57:20,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:57:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2018-04-09 20:57:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4610. [2018-04-09 20:57:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4610 states. [2018-04-09 20:57:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 5794 transitions. [2018-04-09 20:57:21,127 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 5794 transitions. Word has length 54 [2018-04-09 20:57:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:21,127 INFO L459 AbstractCegarLoop]: Abstraction has 4610 states and 5794 transitions. [2018-04-09 20:57:21,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:57:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 5794 transitions. [2018-04-09 20:57:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 20:57:21,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:21,128 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:21,128 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash -682198927, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:21,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:21,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:21,465 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:21,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:21,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-04-09 20:57:21,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:57:21,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:57:21,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:57:21,822 INFO L87 Difference]: Start difference. First operand 4610 states and 5794 transitions. Second operand 13 states. [2018-04-09 20:57:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:22,653 INFO L93 Difference]: Finished difference Result 18503 states and 23073 transitions. [2018-04-09 20:57:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 20:57:22,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-09 20:57:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:22,747 INFO L225 Difference]: With dead ends: 18503 [2018-04-09 20:57:22,747 INFO L226 Difference]: Without dead ends: 13908 [2018-04-09 20:57:22,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:57:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13908 states. [2018-04-09 20:57:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13908 to 10959. [2018-04-09 20:57:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10959 states. [2018-04-09 20:57:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10959 states to 10959 states and 13393 transitions. [2018-04-09 20:57:23,284 INFO L78 Accepts]: Start accepts. Automaton has 10959 states and 13393 transitions. Word has length 57 [2018-04-09 20:57:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:23,285 INFO L459 AbstractCegarLoop]: Abstraction has 10959 states and 13393 transitions. [2018-04-09 20:57:23,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:57:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 10959 states and 13393 transitions. [2018-04-09 20:57:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-09 20:57:23,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:23,286 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:23,287 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1922865957, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:23,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:23,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:23,404 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:23,538 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:23,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-09 20:57:23,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 20:57:23,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 20:57:23,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:57:23,539 INFO L87 Difference]: Start difference. First operand 10959 states and 13393 transitions. Second operand 11 states. [2018-04-09 20:57:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:24,411 INFO L93 Difference]: Finished difference Result 14643 states and 17759 transitions. [2018-04-09 20:57:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 20:57:24,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-04-09 20:57:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:24,426 INFO L225 Difference]: With dead ends: 14643 [2018-04-09 20:57:24,426 INFO L226 Difference]: Without dead ends: 3363 [2018-04-09 20:57:24,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-09 20:57:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2018-04-09 20:57:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3224. [2018-04-09 20:57:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3224 states. [2018-04-09 20:57:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 3856 transitions. [2018-04-09 20:57:24,585 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 3856 transitions. Word has length 62 [2018-04-09 20:57:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:24,585 INFO L459 AbstractCegarLoop]: Abstraction has 3224 states and 3856 transitions. [2018-04-09 20:57:24,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 20:57:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3856 transitions. [2018-04-09 20:57:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-09 20:57:24,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:24,588 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:24,588 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash 648684445, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:24,599 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:24,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:24,754 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:24,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:24,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-04-09 20:57:24,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:57:24,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:57:24,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:57:24,946 INFO L87 Difference]: Start difference. First operand 3224 states and 3856 transitions. Second operand 12 states. [2018-04-09 20:57:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:25,712 INFO L93 Difference]: Finished difference Result 13104 states and 16357 transitions. [2018-04-09 20:57:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-09 20:57:25,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2018-04-09 20:57:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:25,751 INFO L225 Difference]: With dead ends: 13104 [2018-04-09 20:57:25,751 INFO L226 Difference]: Without dead ends: 9895 [2018-04-09 20:57:25,762 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-04-09 20:57:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9895 states. [2018-04-09 20:57:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9895 to 8954. [2018-04-09 20:57:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8954 states. [2018-04-09 20:57:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8954 states to 8954 states and 10872 transitions. [2018-04-09 20:57:26,173 INFO L78 Accepts]: Start accepts. Automaton has 8954 states and 10872 transitions. Word has length 72 [2018-04-09 20:57:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:26,173 INFO L459 AbstractCegarLoop]: Abstraction has 8954 states and 10872 transitions. [2018-04-09 20:57:26,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:57:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8954 states and 10872 transitions. [2018-04-09 20:57:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-09 20:57:26,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:26,176 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:26,176 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:26,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1491505209, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:26,184 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:26,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:26,310 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:26,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:26,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-09 20:57:26,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:57:26,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:57:26,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:57:26,491 INFO L87 Difference]: Start difference. First operand 8954 states and 10872 transitions. Second operand 13 states. [2018-04-09 20:57:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:27,021 INFO L93 Difference]: Finished difference Result 18828 states and 22862 transitions. [2018-04-09 20:57:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-09 20:57:27,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-04-09 20:57:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:27,041 INFO L225 Difference]: With dead ends: 18828 [2018-04-09 20:57:27,041 INFO L226 Difference]: Without dead ends: 9457 [2018-04-09 20:57:27,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:57:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9457 states. [2018-04-09 20:57:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9457 to 8897. [2018-04-09 20:57:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8897 states. [2018-04-09 20:57:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 10778 transitions. [2018-04-09 20:57:27,328 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 10778 transitions. Word has length 79 [2018-04-09 20:57:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:27,328 INFO L459 AbstractCegarLoop]: Abstraction has 8897 states and 10778 transitions. [2018-04-09 20:57:27,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:57:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 10778 transitions. [2018-04-09 20:57:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-09 20:57:27,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:27,330 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:27,331 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:27,331 INFO L82 PathProgramCache]: Analyzing trace with hash -876185036, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:27,340 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:27,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:27,450 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:27,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:27,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-09 20:57:27,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:57:27,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:57:27,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:57:27,586 INFO L87 Difference]: Start difference. First operand 8897 states and 10778 transitions. Second operand 16 states. [2018-04-09 20:57:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:28,400 INFO L93 Difference]: Finished difference Result 19631 states and 24160 transitions. [2018-04-09 20:57:28,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 20:57:28,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-04-09 20:57:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:28,471 INFO L225 Difference]: With dead ends: 19631 [2018-04-09 20:57:28,471 INFO L226 Difference]: Without dead ends: 12072 [2018-04-09 20:57:28,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-04-09 20:57:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12072 states. [2018-04-09 20:57:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12072 to 11473. [2018-04-09 20:57:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11473 states. [2018-04-09 20:57:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11473 states to 11473 states and 14180 transitions. [2018-04-09 20:57:28,987 INFO L78 Accepts]: Start accepts. Automaton has 11473 states and 14180 transitions. Word has length 81 [2018-04-09 20:57:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:28,987 INFO L459 AbstractCegarLoop]: Abstraction has 11473 states and 14180 transitions. [2018-04-09 20:57:28,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:57:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 11473 states and 14180 transitions. [2018-04-09 20:57:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-09 20:57:28,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:28,991 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:28,991 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1170271716, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:28,999 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:29,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:29,146 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:29,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:29,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-04-09 20:57:29,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 20:57:29,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 20:57:29,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-09 20:57:29,398 INFO L87 Difference]: Start difference. First operand 11473 states and 14180 transitions. Second operand 17 states. [2018-04-09 20:57:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:30,518 INFO L93 Difference]: Finished difference Result 24394 states and 31735 transitions. [2018-04-09 20:57:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 20:57:30,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-04-09 20:57:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:30,574 INFO L225 Difference]: With dead ends: 24394 [2018-04-09 20:57:30,575 INFO L226 Difference]: Without dead ends: 14259 [2018-04-09 20:57:30,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 20:57:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14259 states. [2018-04-09 20:57:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14259 to 10147. [2018-04-09 20:57:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10147 states. [2018-04-09 20:57:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10147 states to 10147 states and 12490 transitions. [2018-04-09 20:57:31,201 INFO L78 Accepts]: Start accepts. Automaton has 10147 states and 12490 transitions. Word has length 82 [2018-04-09 20:57:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:31,201 INFO L459 AbstractCegarLoop]: Abstraction has 10147 states and 12490 transitions. [2018-04-09 20:57:31,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 20:57:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 10147 states and 12490 transitions. [2018-04-09 20:57:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-09 20:57:31,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:31,204 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:31,204 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1547816782, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:31,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:31,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:57:31,328 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 40 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:31,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:31,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-04-09 20:57:31,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-09 20:57:31,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-09 20:57:31,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-04-09 20:57:31,518 INFO L87 Difference]: Start difference. First operand 10147 states and 12490 transitions. Second operand 19 states. [2018-04-09 20:57:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:32,430 INFO L93 Difference]: Finished difference Result 21721 states and 27198 transitions. [2018-04-09 20:57:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 20:57:32,430 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-04-09 20:57:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:32,455 INFO L225 Difference]: With dead ends: 21721 [2018-04-09 20:57:32,455 INFO L226 Difference]: Without dead ends: 12753 [2018-04-09 20:57:32,466 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-04-09 20:57:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12753 states. [2018-04-09 20:57:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12753 to 10807. [2018-04-09 20:57:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10807 states. [2018-04-09 20:57:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10807 states to 10807 states and 13370 transitions. [2018-04-09 20:57:32,788 INFO L78 Accepts]: Start accepts. Automaton has 10807 states and 13370 transitions. Word has length 86 [2018-04-09 20:57:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:32,788 INFO L459 AbstractCegarLoop]: Abstraction has 10807 states and 13370 transitions. [2018-04-09 20:57:32,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-09 20:57:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 10807 states and 13370 transitions. [2018-04-09 20:57:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-09 20:57:32,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:32,791 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:32,791 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:32,791 INFO L82 PathProgramCache]: Analyzing trace with hash -159603209, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:32,797 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:32,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:32,973 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 7 DAG size of output 5 [2018-04-09 20:57:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-09 20:57:33,171 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-09 20:57:33,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-09 20:57:33,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-04-09 20:57:33,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 20:57:33,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 20:57:33,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:57:33,276 INFO L87 Difference]: Start difference. First operand 10807 states and 13370 transitions. Second operand 11 states. [2018-04-09 20:57:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:33,744 INFO L93 Difference]: Finished difference Result 14715 states and 18101 transitions. [2018-04-09 20:57:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 20:57:33,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2018-04-09 20:57:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:33,752 INFO L225 Difference]: With dead ends: 14715 [2018-04-09 20:57:33,752 INFO L226 Difference]: Without dead ends: 3503 [2018-04-09 20:57:33,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-09 20:57:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2018-04-09 20:57:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2599. [2018-04-09 20:57:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2599 states. [2018-04-09 20:57:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3180 transitions. [2018-04-09 20:57:33,864 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3180 transitions. Word has length 88 [2018-04-09 20:57:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:33,864 INFO L459 AbstractCegarLoop]: Abstraction has 2599 states and 3180 transitions. [2018-04-09 20:57:33,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 20:57:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3180 transitions. [2018-04-09 20:57:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-09 20:57:33,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:33,867 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:33,867 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1651550753, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:33,874 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:33,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:57:34,140 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:34,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:34,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-04-09 20:57:34,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-09 20:57:34,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-09 20:57:34,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-04-09 20:57:34,373 INFO L87 Difference]: Start difference. First operand 2599 states and 3180 transitions. Second operand 22 states. [2018-04-09 20:57:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:35,414 INFO L93 Difference]: Finished difference Result 7887 states and 10253 transitions. [2018-04-09 20:57:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 20:57:35,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-04-09 20:57:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:35,435 INFO L225 Difference]: With dead ends: 7887 [2018-04-09 20:57:35,435 INFO L226 Difference]: Without dead ends: 5344 [2018-04-09 20:57:35,442 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2018-04-09 20:57:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-04-09 20:57:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 3463. [2018-04-09 20:57:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2018-04-09 20:57:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4420 transitions. [2018-04-09 20:57:35,739 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4420 transitions. Word has length 109 [2018-04-09 20:57:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:35,739 INFO L459 AbstractCegarLoop]: Abstraction has 3463 states and 4420 transitions. [2018-04-09 20:57:35,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-09 20:57:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4420 transitions. [2018-04-09 20:57:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-04-09 20:57:35,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:35,744 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:35,744 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1349175365, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:35,756 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:35,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-04-09 20:57:35,950 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-09 20:57:36,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:36,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-09 20:57:36,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:57:36,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:57:36,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:57:36,093 INFO L87 Difference]: Start difference. First operand 3463 states and 4420 transitions. Second operand 16 states. [2018-04-09 20:57:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:36,817 INFO L93 Difference]: Finished difference Result 7813 states and 10131 transitions. [2018-04-09 20:57:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 20:57:36,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2018-04-09 20:57:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:36,827 INFO L225 Difference]: With dead ends: 7813 [2018-04-09 20:57:36,827 INFO L226 Difference]: Without dead ends: 4406 [2018-04-09 20:57:36,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2018-04-09 20:57:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2018-04-09 20:57:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4311. [2018-04-09 20:57:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2018-04-09 20:57:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5576 transitions. [2018-04-09 20:57:37,054 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5576 transitions. Word has length 118 [2018-04-09 20:57:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:37,054 INFO L459 AbstractCegarLoop]: Abstraction has 4311 states and 5576 transitions. [2018-04-09 20:57:37,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:57:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5576 transitions. [2018-04-09 20:57:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-04-09 20:57:37,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:37,058 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:37,059 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:37,059 INFO L82 PathProgramCache]: Analyzing trace with hash 526870510, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:37,068 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:37,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-04-09 20:57:37,230 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 108 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-09 20:57:37,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:37,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 21 [2018-04-09 20:57:37,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 20:57:37,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 20:57:37,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-04-09 20:57:37,444 INFO L87 Difference]: Start difference. First operand 4311 states and 5576 transitions. Second operand 21 states. [2018-04-09 20:57:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:38,580 INFO L93 Difference]: Finished difference Result 10003 states and 13164 transitions. [2018-04-09 20:57:38,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-09 20:57:38,581 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 146 [2018-04-09 20:57:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:38,591 INFO L225 Difference]: With dead ends: 10003 [2018-04-09 20:57:38,591 INFO L226 Difference]: Without dead ends: 5748 [2018-04-09 20:57:38,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2018-04-09 20:57:38,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2018-04-09 20:57:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 4347. [2018-04-09 20:57:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4347 states. [2018-04-09 20:57:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5648 transitions. [2018-04-09 20:57:38,831 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5648 transitions. Word has length 146 [2018-04-09 20:57:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:38,832 INFO L459 AbstractCegarLoop]: Abstraction has 4347 states and 5648 transitions. [2018-04-09 20:57:38,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 20:57:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5648 transitions. [2018-04-09 20:57:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-09 20:57:38,835 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:38,836 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:38,836 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash -572730924, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:38,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:38,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 202 proven. 7 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-04-09 20:57:38,994 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 136 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-04-09 20:57:39,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:39,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-09 20:57:39,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:57:39,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:57:39,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:57:39,179 INFO L87 Difference]: Start difference. First operand 4347 states and 5648 transitions. Second operand 16 states. [2018-04-09 20:57:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:39,974 INFO L93 Difference]: Finished difference Result 10501 states and 13945 transitions. [2018-04-09 20:57:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 20:57:39,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2018-04-09 20:57:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:40,010 INFO L225 Difference]: With dead ends: 10501 [2018-04-09 20:57:40,010 INFO L226 Difference]: Without dead ends: 6210 [2018-04-09 20:57:40,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:57:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6210 states. [2018-04-09 20:57:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6210 to 5987. [2018-04-09 20:57:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2018-04-09 20:57:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 7810 transitions. [2018-04-09 20:57:40,351 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 7810 transitions. Word has length 170 [2018-04-09 20:57:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:40,351 INFO L459 AbstractCegarLoop]: Abstraction has 5987 states and 7810 transitions. [2018-04-09 20:57:40,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:57:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 7810 transitions. [2018-04-09 20:57:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-09 20:57:40,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:40,355 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:40,355 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash 857657893, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:40,364 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-09 20:57:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-09 20:57:40,687 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-09 20:57:40,804 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-09 20:57:40,824 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,825 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,826 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,827 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,828 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,829 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,835 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,836 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,836 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,837 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,838 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,842 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,843 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,844 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,844 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,845 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,845 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,846 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,850 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,850 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,851 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,851 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,852 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,853 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,853 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,854 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,854 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,857 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,858 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,859 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,859 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,860 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,860 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,861 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,861 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,862 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,862 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,863 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,863 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,866 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,867 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,867 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,868 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,868 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,869 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,869 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,870 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,870 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,871 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,871 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,872 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,873 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:57:40,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:57:40 BoogieIcfgContainer [2018-04-09 20:57:40,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:57:40,898 INFO L168 Benchmark]: Toolchain (without parser) took 26025.31 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 930.1 MB). Free memory was 241.6 MB in the beginning and 758.3 MB in the end (delta: -516.7 MB). Peak memory consumption was 413.4 MB. Max. memory is 5.3 GB. [2018-04-09 20:57:40,900 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:57:40,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.76 ms. Allocated memory is still 304.6 MB. Free memory was 241.6 MB in the beginning and 214.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:57:40,901 INFO L168 Benchmark]: Boogie Preprocessor took 57.50 ms. Allocated memory is still 304.6 MB. Free memory was 214.6 MB in the beginning and 212.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:57:40,901 INFO L168 Benchmark]: RCFGBuilder took 652.37 ms. Allocated memory was 304.6 MB in the beginning and 465.0 MB in the end (delta: 160.4 MB). Free memory was 212.6 MB in the beginning and 389.2 MB in the end (delta: -176.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-04-09 20:57:40,902 INFO L168 Benchmark]: TraceAbstraction took 24961.22 ms. Allocated memory was 465.0 MB in the beginning and 1.2 GB in the end (delta: 769.7 MB). Free memory was 389.2 MB in the beginning and 758.3 MB in the end (delta: -369.1 MB). Peak memory consumption was 400.6 MB. Max. memory is 5.3 GB. [2018-04-09 20:57:40,904 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.18 ms. Allocated memory is still 304.6 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 349.76 ms. Allocated memory is still 304.6 MB. Free memory was 241.6 MB in the beginning and 214.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 57.50 ms. Allocated memory is still 304.6 MB. Free memory was 214.6 MB in the beginning and 212.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 652.37 ms. Allocated memory was 304.6 MB in the beginning and 465.0 MB in the end (delta: 160.4 MB). Free memory was 212.6 MB in the beginning and 389.2 MB in the end (delta: -176.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24961.22 ms. Allocated memory was 465.0 MB in the beginning and 1.2 GB in the end (delta: 769.7 MB). Free memory was 389.2 MB in the beginning and 758.3 MB in the end (delta: -369.1 MB). Peak memory consumption was 400.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L625] int pc1 = 1; VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=18, \old(t1)=14, \old(t4)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={24:16}, pc1=1, pc4=22, res4=12, S={13:15}, t1={18:14}, t4={17:21}, x1={9:19}, x4={23:25}] [L626] int pc4 = 1; VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=18, \old(t1)=14, \old(t4)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={24:16}, pc1=1, pc4=1, res4=12, S={13:15}, t1={18:14}, t4={17:21}, x1={9:19}, x4={23:25}] [L624] struct cell *S; VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=14, \old(t1)=18, \old(t4)=21, \old(t4)=17, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={24:16}, pc1=1, pc4=1, res4=12, S={0:0}, t1={18:14}, t4={17:21}, x1={9:19}, x4={23:25}] [L627] static struct cell *t1 = ((void *)0); VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=18, \old(t1)=14, \old(t4)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \old(x4)=25, \old(x4)=23, garbage={24:16}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={17:21}, x1={9:19}, x4={23:25}] [L628] static struct cell *x1 = ((void *)0); VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=14, \old(t1)=18, \old(t4)=17, \old(t4)=21, \old(x1)=9, \old(x1)=19, \old(x4)=23, \old(x4)=25, garbage={24:16}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={17:21}, x1={0:0}, x4={23:25}] [L657] struct cell* garbage; VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=18, \old(t1)=14, \old(t4)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={0:0}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={17:21}, x1={0:0}, x4={23:25}] [L658] static struct cell *t4 = ((void *)0); VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=18, \old(t1)=14, \old(t4)=21, \old(t4)=17, \old(x1)=19, \old(x1)=9, \old(x4)=25, \old(x4)=23, garbage={0:0}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={23:25}] [L659] static struct cell *x4 = ((void *)0); VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=14, \old(t1)=18, \old(t4)=21, \old(t4)=17, \old(x1)=9, \old(x1)=19, \old(x4)=25, \old(x4)=23, garbage={0:0}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L662] static int res4; VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=14, \old(t1)=18, \old(t4)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \old(x4)=25, \old(x4)=23, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L632] COND TRUE case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={43:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={43:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={43:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={43:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] COND TRUE case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] COND FALSE !(case 3:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] COND FALSE !(case 3:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] COND FALSE !(case 4:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L646] COND TRUE case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L647] COND TRUE S == t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] COND FALSE !(case 3:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] COND FALSE !(case 4:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L646] COND FALSE !(case 5:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L652] case 6: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L652] COND TRUE case 6: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L701] S = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L702] t1 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L703] x1 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L704] t4 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L705] x4 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 129 locations, 19 error locations. UNSAFE Result, 24.8s OverallTime, 23 OverallIterations, 7 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3601 SDtfs, 11138 SDslu, 9730 SDs, 0 SdLazy, 8155 SolverSat, 1587 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3158 GetRequests, 2760 SyntacticMatches, 11 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2197 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11473occurred in iteration=15, 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: 4.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 16281 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1645 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2906 ConstructedInterpolants, 0 QuantifiedInterpolants, 623397 SizeOfPredicates, 125 NumberOfNonLiveVariables, 7500 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 1618/1922 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_20-57-40-916.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_20-57-40-916.csv Received shutdown request...