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.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 17:01:38,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 17:01:38,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 17:01:38,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 17:01:38,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 17:01:38,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 17:01:38,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 17:01:38,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 17:01:38,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 17:01:38,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 17:01:38,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 17:01:38,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 17:01:38,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 17:01:38,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 17:01:38,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 17:01:38,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 17:01:38,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 17:01:38,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 17:01:38,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 17:01:38,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 17:01:38,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 17:01:38,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 17:01:38,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 17:01:38,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 17:01:38,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 17:01:38,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 17:01:38,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 17:01:38,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 17:01:38,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 17:01:38,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 17:01:38,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 17:01:38,635 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-05 17:01:38,662 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 17:01:38,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 17:01:38,663 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 17:01:38,663 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 17:01:38,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 17:01:38,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 17:01:38,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 17:01:38,665 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 17:01:38,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 17:01:38,665 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 17:01:38,666 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 17:01:38,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 17:01:38,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 17:01:38,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 17:01:38,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 17:01:38,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 17:01:38,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 17:01:38,667 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 17:01:38,667 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 17:01:38,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 17:01:38,668 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 17:01:38,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 17:01:38,668 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 17:01:38,668 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 17:01:38,669 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 17:01:38,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 17:01:38,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 17:01:38,669 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 17:01:38,669 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 17:01:38,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 17:01:38,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 17:01:38,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:01:38,670 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 17:01:38,671 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 17:01:38,671 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 17:01:38,671 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 17:01:38,672 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 17:01:38,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 17:01:38,726 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 17:01:38,730 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 17:01:38,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 17:01:38,731 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 17:01:38,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,106 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG50ed24167 [2018-04-05 17:01:39,322 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 17:01:39,322 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 17:01:39,323 INFO L168 CDTParser]: Scanning lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,334 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 17:01:39,335 INFO L215 ultiparseSymbolTable]: [2018-04-05 17:01:39,335 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 17:01:39,335 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,335 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,335 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,335 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:39,386 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG50ed24167 [2018-04-05 17:01:39,391 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 17:01:39,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 17:01:39,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 17:01:39,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 17:01:39,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 17:01:39,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ab5c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39, skipping insertion in model container [2018-04-05 17:01:39,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,425 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:01:39,483 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:01:39,714 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:01:39,776 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:01:39,784 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-05 17:01:39,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39 WrapperNode [2018-04-05 17:01:39,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 17:01:39,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 17:01:39,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 17:01:39,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 17:01:39,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (1/1) ... [2018-04-05 17:01:39,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 17:01:39,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 17:01:39,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 17:01:39,931 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 17:01:39,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (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-05 17:01:40,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 17:01:40,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 17:01:40,083 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-05 17:01:40,084 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-05 17:01:40,084 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 17:01:40,084 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-05 17:01:40,084 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-05 17:01:40,085 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-05 17:01:40,085 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-05 17:01:40,085 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-05 17:01:40,085 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-05 17:01:40,085 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-05 17:01:40,085 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-05 17:01:40,086 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-05 17:01:40,086 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-05 17:01:40,086 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-05 17:01:40,086 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-05 17:01:40,086 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-05 17:01:40,086 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-05 17:01:40,086 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-05 17:01:40,087 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-05 17:01:40,087 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-05 17:01:40,087 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-05 17:01:40,087 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-05 17:01:40,087 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-05 17:01:40,087 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-05 17:01:40,088 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-05 17:01:40,088 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-05 17:01:40,088 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-05 17:01:40,088 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-05 17:01:40,088 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-05 17:01:40,088 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-05 17:01:40,089 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-05 17:01:40,097 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-05 17:01:40,098 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-05 17:01:40,099 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-05 17:01:40,100 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-05 17:01:40,101 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-05 17:01:40,102 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-05 17:01:40,103 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-05 17:01:40,104 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-05 17:01:40,105 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-05 17:01:40,109 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-05 17:01:40,109 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-05 17:01:40,109 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 17:01:40,110 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-05 17:01:40,111 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-05 17:01:40,111 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-05 17:01:40,111 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 17:01:40,111 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 17:01:40,111 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 17:01:40,111 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 17:01:40,111 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 17:01:40,112 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 17:01:40,859 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 17:01:40,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:01:40 BoogieIcfgContainer [2018-04-05 17:01:40,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 17:01:40,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 17:01:40,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 17:01:40,864 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 17:01:40,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:01:39" (1/3) ... [2018-04-05 17:01:40,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee7e0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:01:40, skipping insertion in model container [2018-04-05 17:01:40,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:01:39" (2/3) ... [2018-04-05 17:01:40,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee7e0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:01:40, skipping insertion in model container [2018-04-05 17:01:40,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:01:40" (3/3) ... [2018-04-05 17:01:40,875 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-04-05 17:01:40,888 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 17:01:40,895 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-05 17:01:40,948 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 17:01:40,948 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 17:01:40,948 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 17:01:40,948 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 17:01:40,948 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 17:01:40,948 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 17:01:40,949 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 17:01:40,949 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 17:01:40,949 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 17:01:40,949 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 17:01:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-04-05 17:01:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-05 17:01:40,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:40,976 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-05 17:01:40,976 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-05 17:01:40,981 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-05 17:01:40,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:41,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:41,112 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:41,147 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-05 17:01:41,184 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:41,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 17:01:41,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-05 17:01:41,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-05 17:01:41,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-05 17:01:41,198 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2018-04-05 17:01:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:41,225 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-04-05 17:01:41,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-05 17:01:41,226 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-04-05 17:01:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:41,242 INFO L225 Difference]: With dead ends: 153 [2018-04-05 17:01:41,242 INFO L226 Difference]: Without dead ends: 126 [2018-04-05 17:01:41,246 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-05 17:01:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-05 17:01:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-05 17:01:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-05 17:01:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2018-04-05 17:01:41,299 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 19 [2018-04-05 17:01:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:41,300 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2018-04-05 17:01:41,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-05 17:01:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2018-04-05 17:01:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-05 17:01:41,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:41,301 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-05 17:01:41,301 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-05 17:01:41,301 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-05 17:01:41,308 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:41,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:41,449 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-05 17:01:41,450 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:41,493 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:41,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:01:41,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 17:01:41,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 17:01:41,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 17:01:41,496 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 3 states. [2018-04-05 17:01:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:41,540 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2018-04-05 17:01:41,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 17:01:41,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-05 17:01:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:41,544 INFO L225 Difference]: With dead ends: 150 [2018-04-05 17:01:41,544 INFO L226 Difference]: Without dead ends: 127 [2018-04-05 17:01:41,545 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-05 17:01:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-05 17:01:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-04-05 17:01:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-05 17:01:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-04-05 17:01:41,558 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 24 [2018-04-05 17:01:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:41,559 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-04-05 17:01:41,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 17:01:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-04-05 17:01:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-05 17:01:41,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:41,561 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-05 17:01:41,561 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-05 17:01:41,562 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-05 17:01:41,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:41,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:41,727 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-05 17:01:41,727 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:41,790 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-05 17:01:41,827 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:41,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:01:41,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 17:01:41,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 17:01:41,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 17:01:41,829 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 3 states. [2018-04-05 17:01:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:41,921 INFO L93 Difference]: Finished difference Result 240 states and 276 transitions. [2018-04-05 17:01:41,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 17:01:41,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-05 17:01:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:41,924 INFO L225 Difference]: With dead ends: 240 [2018-04-05 17:01:41,924 INFO L226 Difference]: Without dead ends: 219 [2018-04-05 17:01:41,925 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-05 17:01:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-05 17:01:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-04-05 17:01:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-05 17:01:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 245 transitions. [2018-04-05 17:01:41,951 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 245 transitions. Word has length 26 [2018-04-05 17:01:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:41,952 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 245 transitions. [2018-04-05 17:01:41,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 17:01:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 245 transitions. [2018-04-05 17:01:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-05 17:01:41,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:41,954 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-05 17:01:41,954 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-05 17:01:41,954 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-05 17:01:41,967 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:42,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:42,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 17:01:42,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:01:42,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:01:42,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:01:42,113 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-05 17:01:42,113 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:42,177 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-05 17:01:42,216 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:42,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:01:42,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 17:01:42,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 17:01:42,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 17:01:42,218 INFO L87 Difference]: Start difference. First operand 200 states and 245 transitions. Second operand 4 states. [2018-04-05 17:01:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:42,511 INFO L93 Difference]: Finished difference Result 375 states and 466 transitions. [2018-04-05 17:01:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:01:42,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-05 17:01:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:42,517 INFO L225 Difference]: With dead ends: 375 [2018-04-05 17:01:42,517 INFO L226 Difference]: Without dead ends: 371 [2018-04-05 17:01:42,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-05 17:01:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-05 17:01:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 334. [2018-04-05 17:01:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-05 17:01:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 426 transitions. [2018-04-05 17:01:42,550 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 426 transitions. Word has length 32 [2018-04-05 17:01:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:42,550 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 426 transitions. [2018-04-05 17:01:42,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 17:01:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 426 transitions. [2018-04-05 17:01:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-05 17:01:42,552 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:42,552 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-05 17:01:42,552 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-05 17:01:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -251404698, 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-05 17:01:42,561 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:42,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:42,727 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-05 17:01:42,727 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:42,820 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-05 17:01:42,842 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:42,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-05 17:01:42,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 17:01:42,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 17:01:42,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:01:42,843 INFO L87 Difference]: Start difference. First operand 334 states and 426 transitions. Second operand 5 states. [2018-04-05 17:01:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:43,206 INFO L93 Difference]: Finished difference Result 988 states and 1266 transitions. [2018-04-05 17:01:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 17:01:43,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-05 17:01:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:43,215 INFO L225 Difference]: With dead ends: 988 [2018-04-05 17:01:43,215 INFO L226 Difference]: Without dead ends: 669 [2018-04-05 17:01:43,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:01:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-04-05 17:01:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 502. [2018-04-05 17:01:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-04-05 17:01:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 652 transitions. [2018-04-05 17:01:43,271 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 652 transitions. Word has length 32 [2018-04-05 17:01:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:43,271 INFO L459 AbstractCegarLoop]: Abstraction has 502 states and 652 transitions. [2018-04-05 17:01:43,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 17:01:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 652 transitions. [2018-04-05 17:01:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-05 17:01:43,272 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:43,272 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-05 17:01:43,273 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-05 17:01:43,273 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 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-05 17:01:43,279 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:43,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:43,329 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-05 17:01:43,329 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:43,335 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-05 17:01:43,358 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:43,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 17:01:43,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 17:01:43,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 17:01:43,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 17:01:43,359 INFO L87 Difference]: Start difference. First operand 502 states and 652 transitions. Second operand 3 states. [2018-04-05 17:01:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:43,434 INFO L93 Difference]: Finished difference Result 562 states and 729 transitions. [2018-04-05 17:01:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 17:01:43,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-05 17:01:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:43,438 INFO L225 Difference]: With dead ends: 562 [2018-04-05 17:01:43,438 INFO L226 Difference]: Without dead ends: 550 [2018-04-05 17:01:43,439 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-05 17:01:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-04-05 17:01:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 537. [2018-04-05 17:01:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-05 17:01:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 700 transitions. [2018-04-05 17:01:43,479 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 700 transitions. Word has length 32 [2018-04-05 17:01:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:43,480 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 700 transitions. [2018-04-05 17:01:43,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 17:01:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 700 transitions. [2018-04-05 17:01:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-05 17:01:43,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:43,482 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-05 17:01:43,482 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-05 17:01:43,482 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-05 17:01:43,491 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:43,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:43,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-05 17:01:43,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:01:43,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:01:43,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:01:43,574 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-05 17:01:43,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:43,598 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-05 17:01:43,619 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:43,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 17:01:43,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 17:01:43,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 17:01:43,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:01:43,620 INFO L87 Difference]: Start difference. First operand 537 states and 700 transitions. Second operand 6 states. [2018-04-05 17:01:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:44,159 INFO L93 Difference]: Finished difference Result 843 states and 1079 transitions. [2018-04-05 17:01:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 17:01:44,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-05 17:01:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:44,166 INFO L225 Difference]: With dead ends: 843 [2018-04-05 17:01:44,166 INFO L226 Difference]: Without dead ends: 839 [2018-04-05 17:01:44,167 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-05 17:01:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-04-05 17:01:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 780. [2018-04-05 17:01:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-04-05 17:01:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1021 transitions. [2018-04-05 17:01:44,217 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1021 transitions. Word has length 34 [2018-04-05 17:01:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:44,217 INFO L459 AbstractCegarLoop]: Abstraction has 780 states and 1021 transitions. [2018-04-05 17:01:44,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 17:01:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1021 transitions. [2018-04-05 17:01:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-05 17:01:44,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:44,219 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-05 17:01:44,219 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-05 17:01:44,219 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-05 17:01:44,238 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:44,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:44,458 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 7 DAG size of output 5 [2018-04-05 17:01:44,563 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-05 17:01:44,563 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:44,665 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-05 17:01:44,693 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:44,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2018-04-05 17:01:44,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-05 17:01:44,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-05 17:01:44,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-05 17:01:44,695 INFO L87 Difference]: Start difference. First operand 780 states and 1021 transitions. Second operand 11 states. [2018-04-05 17:01:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:45,011 INFO L93 Difference]: Finished difference Result 1937 states and 2575 transitions. [2018-04-05 17:01:45,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-05 17:01:45,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-05 17:01:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:45,028 INFO L225 Difference]: With dead ends: 1937 [2018-04-05 17:01:45,028 INFO L226 Difference]: Without dead ends: 1250 [2018-04-05 17:01:45,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-05 17:01:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-04-05 17:01:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1228. [2018-04-05 17:01:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-04-05 17:01:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1599 transitions. [2018-04-05 17:01:45,117 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1599 transitions. Word has length 34 [2018-04-05 17:01:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:45,121 INFO L459 AbstractCegarLoop]: Abstraction has 1228 states and 1599 transitions. [2018-04-05 17:01:45,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-05 17:01:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1599 transitions. [2018-04-05 17:01:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-05 17:01:45,122 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:45,122 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-05 17:01:45,123 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-05 17:01:45,123 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-05 17:01:45,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:45,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:45,588 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-05 17:01:45,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:46,050 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-05 17:01:46,085 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:46,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-05 17:01:46,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 17:01:46,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 17:01:46,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-05 17:01:46,086 INFO L87 Difference]: Start difference. First operand 1228 states and 1599 transitions. Second operand 9 states. [2018-04-05 17:01:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:46,882 INFO L93 Difference]: Finished difference Result 4681 states and 6073 transitions. [2018-04-05 17:01:46,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:01:46,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-05 17:01:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:46,905 INFO L225 Difference]: With dead ends: 4681 [2018-04-05 17:01:46,905 INFO L226 Difference]: Without dead ends: 3468 [2018-04-05 17:01:46,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:01:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2018-04-05 17:01:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3334. [2018-04-05 17:01:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2018-04-05 17:01:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4215 transitions. [2018-04-05 17:01:47,134 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4215 transitions. Word has length 36 [2018-04-05 17:01:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:47,135 INFO L459 AbstractCegarLoop]: Abstraction has 3334 states and 4215 transitions. [2018-04-05 17:01:47,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 17:01:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4215 transitions. [2018-04-05 17:01:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-05 17:01:47,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:47,137 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-05 17:01:47,137 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-05 17:01:47,137 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-05 17:01:47,146 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:47,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:47,289 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-05 17:01:47,289 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:47,371 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-05 17:01:47,393 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:47,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-05 17:01:47,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 17:01:47,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 17:01:47,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-05 17:01:47,394 INFO L87 Difference]: Start difference. First operand 3334 states and 4215 transitions. Second operand 9 states. [2018-04-05 17:01:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:47,664 INFO L93 Difference]: Finished difference Result 7467 states and 9528 transitions. [2018-04-05 17:01:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-05 17:01:47,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-05 17:01:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:47,686 INFO L225 Difference]: With dead ends: 7467 [2018-04-05 17:01:47,687 INFO L226 Difference]: Without dead ends: 4360 [2018-04-05 17:01:47,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-05 17:01:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2018-04-05 17:01:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4222. [2018-04-05 17:01:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4222 states. [2018-04-05 17:01:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4222 states to 4222 states and 5303 transitions. [2018-04-05 17:01:47,869 INFO L78 Accepts]: Start accepts. Automaton has 4222 states and 5303 transitions. Word has length 54 [2018-04-05 17:01:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:47,869 INFO L459 AbstractCegarLoop]: Abstraction has 4222 states and 5303 transitions. [2018-04-05 17:01:47,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 17:01:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4222 states and 5303 transitions. [2018-04-05 17:01:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-05 17:01:47,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:47,871 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:01:47,871 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-05 17:01:47,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1435809972, 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-05 17:01:47,879 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:47,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:48,091 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:48,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:01:48,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-04-05 17:01:48,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:01:48,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:01:48,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:01:48,424 INFO L87 Difference]: Start difference. First operand 4222 states and 5303 transitions. Second operand 13 states. [2018-04-05 17:01:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:49,279 INFO L93 Difference]: Finished difference Result 13021 states and 16390 transitions. [2018-04-05 17:01:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-05 17:01:49,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-04-05 17:01:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:49,325 INFO L225 Difference]: With dead ends: 13021 [2018-04-05 17:01:49,325 INFO L226 Difference]: Without dead ends: 8814 [2018-04-05 17:01:49,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=677, Unknown=0, NotChecked=0, Total=930 [2018-04-05 17:01:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2018-04-05 17:01:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 7296. [2018-04-05 17:01:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2018-04-05 17:01:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 8931 transitions. [2018-04-05 17:01:49,795 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 8931 transitions. Word has length 59 [2018-04-05 17:01:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:49,796 INFO L459 AbstractCegarLoop]: Abstraction has 7296 states and 8931 transitions. [2018-04-05 17:01:49,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:01:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 8931 transitions. [2018-04-05 17:01:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-05 17:01:49,797 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:49,798 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-05 17:01:49,798 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-05 17:01:49,798 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-05 17:01:49,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:49,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:49,956 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-05 17:01:49,956 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:50,058 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-05 17:01:50,082 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:01:50,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-05 17:01:50,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-05 17:01:50,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-05 17:01:50,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-05 17:01:50,084 INFO L87 Difference]: Start difference. First operand 7296 states and 8931 transitions. Second operand 11 states. [2018-04-05 17:01:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:50,559 INFO L93 Difference]: Finished difference Result 9653 states and 11715 transitions. [2018-04-05 17:01:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 17:01:50,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-04-05 17:01:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:50,571 INFO L225 Difference]: With dead ends: 9653 [2018-04-05 17:01:50,571 INFO L226 Difference]: Without dead ends: 2496 [2018-04-05 17:01:50,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-05 17:01:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2018-04-05 17:01:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2389. [2018-04-05 17:01:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2018-04-05 17:01:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 2864 transitions. [2018-04-05 17:01:50,701 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 2864 transitions. Word has length 62 [2018-04-05 17:01:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:50,701 INFO L459 AbstractCegarLoop]: Abstraction has 2389 states and 2864 transitions. [2018-04-05 17:01:50,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-05 17:01:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 2864 transitions. [2018-04-05 17:01:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-05 17:01:50,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:50,705 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:01:50,705 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-05 17:01:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1481701379, 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-05 17:01:50,719 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:50,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:50,885 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:51,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:01:51,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-04-05 17:01:51,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 17:01:51,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 17:01:51,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-05 17:01:51,050 INFO L87 Difference]: Start difference. First operand 2389 states and 2864 transitions. Second operand 10 states. [2018-04-05 17:01:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:52,069 INFO L93 Difference]: Finished difference Result 10619 states and 13269 transitions. [2018-04-05 17:01:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:01:52,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-04-05 17:01:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:52,117 INFO L225 Difference]: With dead ends: 10619 [2018-04-05 17:01:52,118 INFO L226 Difference]: Without dead ends: 8245 [2018-04-05 17:01:52,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:01:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2018-04-05 17:01:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 7581. [2018-04-05 17:01:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7581 states. [2018-04-05 17:01:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7581 states to 7581 states and 9265 transitions. [2018-04-05 17:01:52,482 INFO L78 Accepts]: Start accepts. Automaton has 7581 states and 9265 transitions. Word has length 76 [2018-04-05 17:01:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:52,482 INFO L459 AbstractCegarLoop]: Abstraction has 7581 states and 9265 transitions. [2018-04-05 17:01:52,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 17:01:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7581 states and 9265 transitions. [2018-04-05 17:01:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-05 17:01:52,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:52,485 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-05 17:01:52,486 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-05 17:01:52,486 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 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-05 17:01:52,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:52,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:52,826 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-05 17:01:52,826 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:53,115 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-05 17:01:53,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:01:53,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-05 17:01:53,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-05 17:01:53,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-05 17:01:53,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:01:53,138 INFO L87 Difference]: Start difference. First operand 7581 states and 9265 transitions. Second operand 16 states. [2018-04-05 17:01:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:53,925 INFO L93 Difference]: Finished difference Result 17954 states and 22306 transitions. [2018-04-05 17:01:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-05 17:01:53,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-04-05 17:01:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:53,972 INFO L225 Difference]: With dead ends: 17954 [2018-04-05 17:01:53,972 INFO L226 Difference]: Without dead ends: 12247 [2018-04-05 17:01:53,991 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-04-05 17:01:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12247 states. [2018-04-05 17:01:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12247 to 10393. [2018-04-05 17:01:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2018-04-05 17:01:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 12949 transitions. [2018-04-05 17:01:54,523 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 12949 transitions. Word has length 81 [2018-04-05 17:01:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:54,524 INFO L459 AbstractCegarLoop]: Abstraction has 10393 states and 12949 transitions. [2018-04-05 17:01:54,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-05 17:01:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 12949 transitions. [2018-04-05 17:01:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-05 17:01:54,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:54,527 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-05 17:01:54,527 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-05 17:01:54,528 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 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-05 17:01:54,536 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:54,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:54,844 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-05 17:01:54,868 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:54,974 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-05 17:01:54,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:01:54,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-04-05 17:01:54,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:01:54,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:01:54,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-05 17:01:54,996 INFO L87 Difference]: Start difference. First operand 10393 states and 12949 transitions. Second operand 17 states. [2018-04-05 17:01:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:56,330 INFO L93 Difference]: Finished difference Result 22682 states and 29708 transitions. [2018-04-05 17:01:56,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-05 17:01:56,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-04-05 17:01:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:56,389 INFO L225 Difference]: With dead ends: 22682 [2018-04-05 17:01:56,389 INFO L226 Difference]: Without dead ends: 14163 [2018-04-05 17:01:56,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2018-04-05 17:01:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14163 states. [2018-04-05 17:01:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14163 to 9121. [2018-04-05 17:01:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2018-04-05 17:01:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 11355 transitions. [2018-04-05 17:01:56,971 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 11355 transitions. Word has length 82 [2018-04-05 17:01:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:56,971 INFO L459 AbstractCegarLoop]: Abstraction has 9121 states and 11355 transitions. [2018-04-05 17:01:56,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:01:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 11355 transitions. [2018-04-05 17:01:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-05 17:01:56,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:56,973 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:01:56,973 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-05 17:01:56,974 INFO L82 PathProgramCache]: Analyzing trace with hash 476919487, 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-05 17:01:56,981 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:57,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:57,108 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:57,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:01:57,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-05 17:01:57,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:01:57,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:01:57,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:01:57,240 INFO L87 Difference]: Start difference. First operand 9121 states and 11355 transitions. Second operand 13 states. [2018-04-05 17:01:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:57,890 INFO L93 Difference]: Finished difference Result 18243 states and 22674 transitions. [2018-04-05 17:01:57,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:01:57,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2018-04-05 17:01:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:57,920 INFO L225 Difference]: With dead ends: 18243 [2018-04-05 17:01:57,920 INFO L226 Difference]: Without dead ends: 8957 [2018-04-05 17:01:57,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-04-05 17:01:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2018-04-05 17:01:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8761. [2018-04-05 17:01:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8761 states. [2018-04-05 17:01:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8761 states to 8761 states and 10911 transitions. [2018-04-05 17:01:58,427 INFO L78 Accepts]: Start accepts. Automaton has 8761 states and 10911 transitions. Word has length 83 [2018-04-05 17:01:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:01:58,427 INFO L459 AbstractCegarLoop]: Abstraction has 8761 states and 10911 transitions. [2018-04-05 17:01:58,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:01:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8761 states and 10911 transitions. [2018-04-05 17:01:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-05 17:01:58,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:01:58,429 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, 1, 1, 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-05 17:01:58,429 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-05 17:01:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash 193067153, 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-05 17:01:58,450 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:01:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:01:58,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:01:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:01:58,651 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:01:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:01:58,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:01:58,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-04-05 17:01:58,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:01:58,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:01:58,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-05 17:01:58,812 INFO L87 Difference]: Start difference. First operand 8761 states and 10911 transitions. Second operand 17 states. [2018-04-05 17:01:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:01:59,700 INFO L93 Difference]: Finished difference Result 21585 states and 27348 transitions. [2018-04-05 17:01:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-05 17:01:59,701 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-04-05 17:01:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:01:59,733 INFO L225 Difference]: With dead ends: 21585 [2018-04-05 17:01:59,734 INFO L226 Difference]: Without dead ends: 12676 [2018-04-05 17:01:59,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-04-05 17:01:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12676 states. [2018-04-05 17:02:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12676 to 10640. [2018-04-05 17:02:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10640 states. [2018-04-05 17:02:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10640 states to 10640 states and 13496 transitions. [2018-04-05 17:02:00,324 INFO L78 Accepts]: Start accepts. Automaton has 10640 states and 13496 transitions. Word has length 88 [2018-04-05 17:02:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:00,324 INFO L459 AbstractCegarLoop]: Abstraction has 10640 states and 13496 transitions. [2018-04-05 17:02:00,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:02:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 10640 states and 13496 transitions. [2018-04-05 17:02:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-05 17:02:00,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:00,328 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-05 17:02:00,328 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-05 17:02:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash -242131558, 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-05 17:02:00,338 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:00,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-05 17:02:00,521 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-05 17:02:00,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:00,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-05 17:02:00,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:02:00,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:02:00,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:02:00,697 INFO L87 Difference]: Start difference. First operand 10640 states and 13496 transitions. Second operand 13 states. [2018-04-05 17:02:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:02,832 INFO L93 Difference]: Finished difference Result 43420 states and 57079 transitions. [2018-04-05 17:02:02,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-05 17:02:02,832 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2018-04-05 17:02:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:02,895 INFO L225 Difference]: With dead ends: 43420 [2018-04-05 17:02:02,895 INFO L226 Difference]: Without dead ends: 32795 [2018-04-05 17:02:02,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-04-05 17:02:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32795 states. [2018-04-05 17:02:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32795 to 26574. [2018-04-05 17:02:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26574 states. [2018-04-05 17:02:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26574 states to 26574 states and 34015 transitions. [2018-04-05 17:02:04,440 INFO L78 Accepts]: Start accepts. Automaton has 26574 states and 34015 transitions. Word has length 92 [2018-04-05 17:02:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:04,440 INFO L459 AbstractCegarLoop]: Abstraction has 26574 states and 34015 transitions. [2018-04-05 17:02:04,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:02:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 26574 states and 34015 transitions. [2018-04-05 17:02:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-05 17:02:04,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:04,444 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:02:04,445 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-05 17:02:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash 828783997, 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-05 17:02:04,452 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:04,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-04-05 17:02:04,543 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:04,675 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 12 DAG size of output 9 [2018-04-05 17:02:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-05 17:02:04,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-05 17:02:04,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2018-04-05 17:02:04,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 17:02:04,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 17:02:04,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-05 17:02:04,740 INFO L87 Difference]: Start difference. First operand 26574 states and 34015 transitions. Second operand 10 states. [2018-04-05 17:02:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:05,707 INFO L93 Difference]: Finished difference Result 42804 states and 54563 transitions. [2018-04-05 17:02:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 17:02:05,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2018-04-05 17:02:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:05,730 INFO L225 Difference]: With dead ends: 42804 [2018-04-05 17:02:05,730 INFO L226 Difference]: Without dead ends: 15165 [2018-04-05 17:02:05,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-04-05 17:02:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15165 states. [2018-04-05 17:02:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15165 to 13511. [2018-04-05 17:02:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13511 states. [2018-04-05 17:02:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 17389 transitions. [2018-04-05 17:02:06,349 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 17389 transitions. Word has length 92 [2018-04-05 17:02:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:06,350 INFO L459 AbstractCegarLoop]: Abstraction has 13511 states and 17389 transitions. [2018-04-05 17:02:06,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 17:02:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 17389 transitions. [2018-04-05 17:02:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-05 17:02:06,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:06,353 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-05 17:02:06,353 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-05 17:02:06,353 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 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-05 17:02:06,367 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:06,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:06,509 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-05 17:02:06,510 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:06,735 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-05 17:02:06,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:06,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-04-05 17:02:06,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-05 17:02:06,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-05 17:02:06,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-04-05 17:02:06,765 INFO L87 Difference]: Start difference. First operand 13511 states and 17389 transitions. Second operand 22 states. [2018-04-05 17:02:08,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:08,804 INFO L93 Difference]: Finished difference Result 42066 states and 57162 transitions. [2018-04-05 17:02:08,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-05 17:02:08,805 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-04-05 17:02:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:08,858 INFO L225 Difference]: With dead ends: 42066 [2018-04-05 17:02:08,858 INFO L226 Difference]: Without dead ends: 28611 [2018-04-05 17:02:08,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2018-04-05 17:02:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28611 states. [2018-04-05 17:02:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28611 to 18527. [2018-04-05 17:02:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18527 states. [2018-04-05 17:02:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18527 states to 18527 states and 25001 transitions. [2018-04-05 17:02:09,900 INFO L78 Accepts]: Start accepts. Automaton has 18527 states and 25001 transitions. Word has length 109 [2018-04-05 17:02:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:09,900 INFO L459 AbstractCegarLoop]: Abstraction has 18527 states and 25001 transitions. [2018-04-05 17:02:09,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-05 17:02:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 18527 states and 25001 transitions. [2018-04-05 17:02:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-04-05 17:02:09,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:09,903 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-05 17:02:09,903 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-05 17:02:09,903 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 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-05 17:02:09,922 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:10,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:10,056 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-05 17:02:10,056 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:10,170 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-05 17:02:10,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:10,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-05 17:02:10,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-05 17:02:10,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-05 17:02:10,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:02:10,192 INFO L87 Difference]: Start difference. First operand 18527 states and 25001 transitions. Second operand 16 states. [2018-04-05 17:02:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:11,713 INFO L93 Difference]: Finished difference Result 42030 states and 57210 transitions. [2018-04-05 17:02:11,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-05 17:02:11,713 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2018-04-05 17:02:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:11,756 INFO L225 Difference]: With dead ends: 42030 [2018-04-05 17:02:11,756 INFO L226 Difference]: Without dead ends: 23559 [2018-04-05 17:02:11,782 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2018-04-05 17:02:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23559 states. [2018-04-05 17:02:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23559 to 23191. [2018-04-05 17:02:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23191 states. [2018-04-05 17:02:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23191 states to 23191 states and 31381 transitions. [2018-04-05 17:02:12,998 INFO L78 Accepts]: Start accepts. Automaton has 23191 states and 31381 transitions. Word has length 118 [2018-04-05 17:02:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:12,998 INFO L459 AbstractCegarLoop]: Abstraction has 23191 states and 31381 transitions. [2018-04-05 17:02:12,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-05 17:02:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 23191 states and 31381 transitions. [2018-04-05 17:02:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-04-05 17:02:13,001 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:13,001 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-05 17:02:13,001 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-05 17:02:13,001 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 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-05 17:02:13,007 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:13,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:13,140 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-05 17:02:13,140 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:13,320 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-05 17:02:13,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:13,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 21 [2018-04-05 17:02:13,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-05 17:02:13,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-05 17:02:13,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-04-05 17:02:13,341 INFO L87 Difference]: Start difference. First operand 23191 states and 31381 transitions. Second operand 21 states. [2018-04-05 17:02:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:15,583 INFO L93 Difference]: Finished difference Result 54072 states and 74254 transitions. [2018-04-05 17:02:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-05 17:02:15,583 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 146 [2018-04-05 17:02:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:15,645 INFO L225 Difference]: With dead ends: 54072 [2018-04-05 17:02:15,646 INFO L226 Difference]: Without dead ends: 30937 [2018-04-05 17:02:15,679 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2018-04-05 17:02:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30937 states. [2018-04-05 17:02:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30937 to 23367. [2018-04-05 17:02:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23367 states. [2018-04-05 17:02:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23367 states to 23367 states and 31733 transitions. [2018-04-05 17:02:16,868 INFO L78 Accepts]: Start accepts. Automaton has 23367 states and 31733 transitions. Word has length 146 [2018-04-05 17:02:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:16,869 INFO L459 AbstractCegarLoop]: Abstraction has 23367 states and 31733 transitions. [2018-04-05 17:02:16,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-05 17:02:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23367 states and 31733 transitions. [2018-04-05 17:02:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-05 17:02:16,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:16,871 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-05 17:02:16,871 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-05 17:02:16,871 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 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-05 17:02:17,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:17,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:17,542 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-05 17:02:17,542 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:17,675 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-05 17:02:17,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:17,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-05 17:02:17,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-05 17:02:17,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-05 17:02:17,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:02:17,704 INFO L87 Difference]: Start difference. First operand 23367 states and 31733 transitions. Second operand 16 states. [2018-04-05 17:02:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:19,915 INFO L93 Difference]: Finished difference Result 56312 states and 77694 transitions. [2018-04-05 17:02:19,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-05 17:02:19,915 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2018-04-05 17:02:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:19,987 INFO L225 Difference]: With dead ends: 56312 [2018-04-05 17:02:19,987 INFO L226 Difference]: Without dead ends: 33001 [2018-04-05 17:02:20,027 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-05 17:02:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33001 states. [2018-04-05 17:02:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33001 to 32695. [2018-04-05 17:02:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32695 states. [2018-04-05 17:02:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32695 states to 32695 states and 44581 transitions. [2018-04-05 17:02:22,027 INFO L78 Accepts]: Start accepts. Automaton has 32695 states and 44581 transitions. Word has length 170 [2018-04-05 17:02:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:22,027 INFO L459 AbstractCegarLoop]: Abstraction has 32695 states and 44581 transitions. [2018-04-05 17:02:22,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-05 17:02:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32695 states and 44581 transitions. [2018-04-05 17:02:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-05 17:02:22,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:22,031 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-05 17:02:22,031 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__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-05 17:02:22,032 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:02:22,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:22,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 87 proven. 107 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-04-05 17:02:22,190 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 81 proven. 113 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-04-05 17:02:22,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:22,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-05 17:02:22,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 17:02:22,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 17:02:22,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-05 17:02:22,358 INFO L87 Difference]: Start difference. First operand 32695 states and 44581 transitions. Second operand 12 states. [2018-04-05 17:02:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:25,132 INFO L93 Difference]: Finished difference Result 76927 states and 104993 transitions. [2018-04-05 17:02:25,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-05 17:02:25,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2018-04-05 17:02:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:25,235 INFO L225 Difference]: With dead ends: 76927 [2018-04-05 17:02:25,235 INFO L226 Difference]: Without dead ends: 44288 [2018-04-05 17:02:25,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-04-05 17:02:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44288 states. [2018-04-05 17:02:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44288 to 43695. [2018-04-05 17:02:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43695 states. [2018-04-05 17:02:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43695 states to 43695 states and 59675 transitions. [2018-04-05 17:02:27,760 INFO L78 Accepts]: Start accepts. Automaton has 43695 states and 59675 transitions. Word has length 170 [2018-04-05 17:02:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:27,761 INFO L459 AbstractCegarLoop]: Abstraction has 43695 states and 59675 transitions. [2018-04-05 17:02:27,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 17:02:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 43695 states and 59675 transitions. [2018-04-05 17:02:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-05 17:02:27,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:27,766 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:02:27,766 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__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-05 17:02:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1130216723, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:02:27,949 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:28,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 208 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-04-05 17:02:28,230 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 156 proven. 36 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-04-05 17:02:28,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:28,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-05 17:02:28,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 17:02:28,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 17:02:28,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:02:28,402 INFO L87 Difference]: Start difference. First operand 43695 states and 59675 transitions. Second operand 15 states. [2018-04-05 17:02:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:31,972 INFO L93 Difference]: Finished difference Result 100204 states and 137062 transitions. [2018-04-05 17:02:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-05 17:02:31,973 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 172 [2018-04-05 17:02:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:32,107 INFO L225 Difference]: With dead ends: 100204 [2018-04-05 17:02:32,108 INFO L226 Difference]: Without dead ends: 56565 [2018-04-05 17:02:32,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2018-04-05 17:02:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56565 states. [2018-04-05 17:02:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56565 to 50015. [2018-04-05 17:02:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50015 states. [2018-04-05 17:02:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50015 states to 50015 states and 68117 transitions. [2018-04-05 17:02:35,327 INFO L78 Accepts]: Start accepts. Automaton has 50015 states and 68117 transitions. Word has length 172 [2018-04-05 17:02:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:35,328 INFO L459 AbstractCegarLoop]: Abstraction has 50015 states and 68117 transitions. [2018-04-05 17:02:35,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 17:02:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50015 states and 68117 transitions. [2018-04-05 17:02:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-05 17:02:35,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:35,332 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:02:35,333 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__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-05 17:02:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1558902031, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:02:35,339 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:35,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 236 proven. 8 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-04-05 17:02:35,496 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 154 proven. 58 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-04-05 17:02:35,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:35,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-05 17:02:35,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 17:02:35,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 17:02:35,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:02:35,685 INFO L87 Difference]: Start difference. First operand 50015 states and 68117 transitions. Second operand 15 states. [2018-04-05 17:02:39,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:39,426 INFO L93 Difference]: Finished difference Result 106524 states and 145064 transitions. [2018-04-05 17:02:39,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:02:39,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 177 [2018-04-05 17:02:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:39,612 INFO L225 Difference]: With dead ends: 106524 [2018-04-05 17:02:39,612 INFO L226 Difference]: Without dead ends: 56565 [2018-04-05 17:02:39,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-04-05 17:02:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56565 states. [2018-04-05 17:02:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56565 to 56335. [2018-04-05 17:02:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56335 states. [2018-04-05 17:02:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56335 states to 56335 states and 76339 transitions. [2018-04-05 17:02:43,098 INFO L78 Accepts]: Start accepts. Automaton has 56335 states and 76339 transitions. Word has length 177 [2018-04-05 17:02:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:02:43,098 INFO L459 AbstractCegarLoop]: Abstraction has 56335 states and 76339 transitions. [2018-04-05 17:02:43,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 17:02:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 56335 states and 76339 transitions. [2018-04-05 17:02:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-04-05 17:02:43,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:02:43,101 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:02:43,101 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__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-05 17:02:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1599515383, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:02:43,107 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:02:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:02:43,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:02:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 150 proven. 114 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-04-05 17:02:43,331 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:02:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 152 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-04-05 17:02:43,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:02:43,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-04-05 17:02:43,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 17:02:43,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 17:02:43,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:02:43,505 INFO L87 Difference]: Start difference. First operand 56335 states and 76339 transitions. Second operand 15 states. [2018-04-05 17:02:44,699 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 29 DAG size of output 19 [2018-04-05 17:02:47,539 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 26 DAG size of output 18 [2018-04-05 17:02:47,881 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 22 DAG size of output 14 [2018-04-05 17:02:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:02:54,626 INFO L93 Difference]: Finished difference Result 85505 states and 117559 transitions. [2018-04-05 17:02:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-05 17:02:54,627 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 181 [2018-04-05 17:02:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:02:54,854 INFO L225 Difference]: With dead ends: 85505 [2018-04-05 17:02:54,854 INFO L226 Difference]: Without dead ends: 85502 [2018-04-05 17:02:54,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2018-04-05 17:02:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85502 states. [2018-04-05 17:03:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85502 to 82786. [2018-04-05 17:03:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82786 states. [2018-04-05 17:03:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82786 states to 82786 states and 112825 transitions. [2018-04-05 17:03:01,431 INFO L78 Accepts]: Start accepts. Automaton has 82786 states and 112825 transitions. Word has length 181 [2018-04-05 17:03:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:03:01,432 INFO L459 AbstractCegarLoop]: Abstraction has 82786 states and 112825 transitions. [2018-04-05 17:03:01,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 17:03:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 82786 states and 112825 transitions. [2018-04-05 17:03:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-04-05 17:03:01,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:03:01,436 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:03:01,436 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__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-05 17:03:01,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1599515382, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:03:01,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:03:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:03:01,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:03:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 86 proven. 140 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-04-05 17:03:02,300 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:03:03,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-04-05 17:03:03,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:03:03,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:03:03,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-04-05 17:03:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 86 proven. 140 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-04-05 17:03:03,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:03:03,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-05 17:03:03,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-05 17:03:03,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-05 17:03:03,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-04-05 17:03:03,747 INFO L87 Difference]: Start difference. First operand 82786 states and 112825 transitions. Second operand 21 states. [2018-04-05 17:03:04,860 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 35 DAG size of output 32 [2018-04-05 17:03:05,093 WARN L148 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-05 17:03:05,659 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-04-05 17:03:06,053 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 36 DAG size of output 28 [2018-04-05 17:03:07,982 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 39 DAG size of output 31 [2018-04-05 17:03:08,346 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 35 DAG size of output 27 [2018-04-05 17:03:08,587 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 36 DAG size of output 29 [2018-04-05 17:03:09,239 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 38 DAG size of output 30 [2018-04-05 17:03:09,992 WARN L151 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 44 DAG size of output 33 [2018-04-05 17:03:10,161 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 29 DAG size of output 25 [2018-04-05 17:03:11,221 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 39 DAG size of output 31 [2018-04-05 17:03:11,620 WARN L151 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 35 DAG size of output 27 [2018-04-05 17:03:11,797 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 31 DAG size of output 23 [2018-04-05 17:03:12,887 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 42 DAG size of output 34 [2018-04-05 17:03:13,181 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 38 DAG size of output 30 [2018-04-05 17:03:13,575 WARN L151 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 41 DAG size of output 37 [2018-04-05 17:03:14,635 WARN L151 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 49 DAG size of output 36 [2018-04-05 17:03:15,149 WARN L151 SmtUtils]: Spent 350ms on a formula simplification. DAG size of input: 45 DAG size of output 37 [2018-04-05 17:03:15,402 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 32 DAG size of output 28 [2018-04-05 17:03:15,709 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 39 DAG size of output 32 [2018-04-05 17:03:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:03:28,350 INFO L93 Difference]: Finished difference Result 144873 states and 199251 transitions. [2018-04-05 17:03:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-05 17:03:28,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2018-04-05 17:03:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:03:28,846 INFO L225 Difference]: With dead ends: 144873 [2018-04-05 17:03:28,846 INFO L226 Difference]: Without dead ends: 144870 [2018-04-05 17:03:28,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 360 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=829, Invalid=2831, Unknown=0, NotChecked=0, Total=3660 [2018-04-05 17:03:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144870 states. [2018-04-05 17:03:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144870 to 139328. [2018-04-05 17:03:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139328 states. [2018-04-05 17:03:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139328 states to 139328 states and 190294 transitions. [2018-04-05 17:03:45,585 INFO L78 Accepts]: Start accepts. Automaton has 139328 states and 190294 transitions. Word has length 181 [2018-04-05 17:03:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:03:45,586 INFO L459 AbstractCegarLoop]: Abstraction has 139328 states and 190294 transitions. [2018-04-05 17:03:45,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-05 17:03:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 139328 states and 190294 transitions. [2018-04-05 17:03:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-05 17:03:45,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:03:45,592 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:03:45,592 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__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-05 17:03:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1120286836, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:03:45,604 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:03:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:03:45,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:03:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 230 proven. 6 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-04-05 17:03:46,254 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:03:46,589 WARN L151 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 15 DAG size of output 12 [2018-04-05 17:03:47,006 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-04-05 17:03:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 136 proven. 76 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-04-05 17:03:47,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:03:47,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-05 17:03:47,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 17:03:47,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 17:03:47,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:03:47,508 INFO L87 Difference]: Start difference. First operand 139328 states and 190294 transitions. Second operand 15 states. [2018-04-05 17:03:48,474 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-04-05 17:03:48,658 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 18 DAG size of output 11 [2018-04-05 17:04:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:04:02,494 INFO L93 Difference]: Finished difference Result 251973 states and 342742 transitions. [2018-04-05 17:04:02,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-05 17:04:02,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 184 [2018-04-05 17:04:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:04:02,959 INFO L225 Difference]: With dead ends: 251973 [2018-04-05 17:04:02,959 INFO L226 Difference]: Without dead ends: 112701 [2018-04-05 17:04:03,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2018-04-05 17:04:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112701 states. [2018-04-05 17:04:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112701 to 96342. [2018-04-05 17:04:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96342 states. [2018-04-05 17:04:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96342 states to 96342 states and 130164 transitions. [2018-04-05 17:04:13,165 INFO L78 Accepts]: Start accepts. Automaton has 96342 states and 130164 transitions. Word has length 184 [2018-04-05 17:04:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:04:13,165 INFO L459 AbstractCegarLoop]: Abstraction has 96342 states and 130164 transitions. [2018-04-05 17:04:13,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 17:04:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 96342 states and 130164 transitions. [2018-04-05 17:04:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-04-05 17:04:13,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:04:13,172 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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-05 17:04:13,172 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__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-05 17:04:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash 604535016, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:04:13,193 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:04:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:04:13,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:04:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 196 proven. 4 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-04-05 17:04:13,735 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:04:13,940 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 15 DAG size of output 12 [2018-04-05 17:04:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 102 proven. 90 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-04-05 17:04:14,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:04:14,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-05 17:04:14,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:04:14,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:04:14,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:04:14,645 INFO L87 Difference]: Start difference. First operand 96342 states and 130164 transitions. Second operand 13 states. [2018-04-05 17:04:15,305 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 18 DAG size of output 11 [2018-04-05 17:04:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:04:25,238 INFO L93 Difference]: Finished difference Result 152471 states and 201817 transitions. [2018-04-05 17:04:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-05 17:04:25,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2018-04-05 17:04:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:04:25,447 INFO L225 Difference]: With dead ends: 152471 [2018-04-05 17:04:25,447 INFO L226 Difference]: Without dead ends: 53944 [2018-04-05 17:04:25,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-04-05 17:04:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53944 states. [2018-04-05 17:04:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53944 to 53409. [2018-04-05 17:04:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53409 states. [2018-04-05 17:04:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53409 states to 53409 states and 67833 transitions. [2018-04-05 17:04:30,830 INFO L78 Accepts]: Start accepts. Automaton has 53409 states and 67833 transitions. Word has length 193 [2018-04-05 17:04:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:04:30,831 INFO L459 AbstractCegarLoop]: Abstraction has 53409 states and 67833 transitions. [2018-04-05 17:04:30,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:04:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 53409 states and 67833 transitions. [2018-04-05 17:04:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-05 17:04:30,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:04:30,844 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 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-05 17:04:30,844 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__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-05 17:04:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -290966208, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:04:30,854 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:04:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:04:31,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:04:31,459 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-04-05 17:04:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 218 proven. 7 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-04-05 17:04:31,856 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:04:31,994 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 15 DAG size of output 9 [2018-04-05 17:04:32,612 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-04-05 17:04:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 196 proven. 21 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-04-05 17:04:33,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:04:33,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-05 17:04:33,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-05 17:04:33,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-05 17:04:33,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:04:33,117 INFO L87 Difference]: Start difference. First operand 53409 states and 67833 transitions. Second operand 16 states. [2018-04-05 17:04:34,356 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-04-05 17:04:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:04:40,818 INFO L93 Difference]: Finished difference Result 104407 states and 132386 transitions. [2018-04-05 17:04:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-05 17:04:40,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 249 [2018-04-05 17:04:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:04:40,906 INFO L225 Difference]: With dead ends: 104407 [2018-04-05 17:04:40,906 INFO L226 Difference]: Without dead ends: 48240 [2018-04-05 17:04:40,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 488 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2018-04-05 17:04:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48240 states. [2018-04-05 17:04:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48240 to 47584. [2018-04-05 17:04:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2018-04-05 17:04:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 57159 transitions. [2018-04-05 17:04:45,034 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 57159 transitions. Word has length 249 [2018-04-05 17:04:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:04:45,035 INFO L459 AbstractCegarLoop]: Abstraction has 47584 states and 57159 transitions. [2018-04-05 17:04:45,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-05 17:04:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 57159 transitions. [2018-04-05 17:04:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-04-05 17:04:45,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:04:45,049 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-05 17:04:45,049 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__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-05 17:04:45,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1301090973, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:04:45,073 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:04:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-05 17:04:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-05 17:04:45,796 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-05 17:04:46,073 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-05 17:04:46,143 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-05 17:04:46,144 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-05 17:04:46,153 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-05 17:04:46,154 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-05 17:04:46,156 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-05 17:04:46,156 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-05 17:04:46,172 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-05 17:04:46,173 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-05 17:04:46,174 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-05 17:04:46,183 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-05 17:04:46,184 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-05 17:04:46,198 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-05 17:04:46,199 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-05 17:04:46,199 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-05 17:04:46,200 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-05 17:04:46,200 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-05 17:04:46,201 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-05 17:04:46,201 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-05 17:04:46,211 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-05 17:04:46,212 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-05 17:04:46,213 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-05 17:04:46,214 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-05 17:04:46,214 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-05 17:04:46,215 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-05 17:04:46,215 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-05 17:04:46,216 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-05 17:04:46,216 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-05 17:04:46,223 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-05 17:04:46,224 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-05 17:04:46,226 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-05 17:04:46,226 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-05 17:04:46,227 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-05 17:04:46,227 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-05 17:04:46,228 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-05 17:04:46,228 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-05 17:04:46,229 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-05 17:04:46,229 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-05 17:04:46,232 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-05 17:04:46,233 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-05 17:04:46,240 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-05 17:04:46,241 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-05 17:04:46,242 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-05 17:04:46,242 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-05 17:04:46,243 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-05 17:04:46,243 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-05 17:04:46,244 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-05 17:04:46,244 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-05 17:04:46,245 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-05 17:04:46,245 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-05 17:04:46,252 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-05 17:04:46,252 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-05 17:04:46,253 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-05 17:04:46,256 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,257 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,257 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,265 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,266 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,266 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,267 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,268 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,275 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,275 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,276 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,277 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,277 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,278 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,278 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,279 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,289 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,290 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,291 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,291 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,292 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,292 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,293 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,293 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,294 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,302 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-05 17:04:46,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:04:46 BoogieIcfgContainer [2018-04-05 17:04:46,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 17:04:46,389 INFO L168 Benchmark]: Toolchain (without parser) took 186996.94 ms. Allocated memory was 300.4 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 237.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-04-05 17:04:46,390 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 17:04:46,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.54 ms. Allocated memory is still 300.4 MB. Free memory was 237.8 MB in the beginning and 210.9 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-04-05 17:04:46,391 INFO L168 Benchmark]: Boogie Preprocessor took 75.91 ms. Allocated memory is still 300.4 MB. Free memory was 210.9 MB in the beginning and 208.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-05 17:04:46,392 INFO L168 Benchmark]: RCFGBuilder took 928.80 ms. Allocated memory was 300.4 MB in the beginning and 459.8 MB in the end (delta: 159.4 MB). Free memory was 208.9 MB in the beginning and 385.2 MB in the end (delta: -176.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-04-05 17:04:46,392 INFO L168 Benchmark]: TraceAbstraction took 185527.49 ms. Allocated memory was 459.8 MB in the beginning and 2.9 GB in the end (delta: 2.5 GB). Free memory was 385.2 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-04-05 17:04:46,399 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 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 459.54 ms. Allocated memory is still 300.4 MB. Free memory was 237.8 MB in the beginning and 210.9 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 75.91 ms. Allocated memory is still 300.4 MB. Free memory was 210.9 MB in the beginning and 208.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 928.80 ms. Allocated memory was 300.4 MB in the beginning and 459.8 MB in the end (delta: 159.4 MB). Free memory was 208.9 MB in the beginning and 385.2 MB in the end (delta: -176.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 185527.49 ms. Allocated memory was 459.8 MB in the beginning and 2.9 GB in the end (delta: 2.5 GB). Free memory was 385.2 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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)=15, \old(S)=13, \old(t1)=14, \old(t1)=18, \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)=15, \old(S)=13, \old(t1)=18, \old(t1)=14, \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={13:15}, t1={18:14}, t4={17:21}, x1={9:19}, x4={23:25}] [L624] struct cell *S; 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)=9, \old(x1)=19, \old(x4)=25, \old(x4)=23, 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)=9, \old(x1)=19, \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)=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={0:0}, t1={0:0}, t4={17:21}, x1={0:0}, x4={23:25}] [L657] struct cell* garbage; 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)=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={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)=14, \old(t1)=18, \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)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \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={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)=18, \old(t1)=14, \old(t4)=17, \old(t4)=21, \old(x1)=9, \old(x1)=19, \old(x4)=23, \old(x4)=25, 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] S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc1 || __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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, 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))={40: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))={40:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={40: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))={40:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={40: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))={40:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=0, \old(x1)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=40, \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={40: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)=40, \old(x1)=0, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__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()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \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={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \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, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \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=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \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=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L664] 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)=40, \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=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=40, \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=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] pop() 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=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__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()=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] pop() 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=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__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()=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] COND TRUE case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, t4->next={0:0}, x1={40:0}, x4={0:0}] [L672] RET x4 = t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, t4->next={0:0}, x1={40:0}, x4={0:0}] [L694] pop() 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=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__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()=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] COND FALSE !(case 3:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L674] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L675] COND TRUE S == t4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] pop() 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=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __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, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __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()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __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()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40: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=5, 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=5, 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=5, 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, 185.4s OverallTime, 32 OverallIterations, 11 TraceHistogramMax, 102.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5501 SDtfs, 17485 SDslu, 15251 SDs, 0 SdLazy, 15470 SolverSat, 2510 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6608 GetRequests, 5935 SyntacticMatches, 19 SemanticMatches, 654 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4021 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139328occurred in iteration=28, 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: 62.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 71390 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 3341 NumberOfCodeBlocks, 3341 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 6114 ConstructedInterpolants, 32 QuantifiedInterpolants, 2691088 SizeOfPredicates, 196 NumberOfNonLiveVariables, 13575 ConjunctsInSsa, 443 ConjunctsInUnsatCore, 62 InterpolantComputations, 23 PerfectInterpolantSequences, 6654/8024 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.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-05_17-04-46-451.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_17-04-46-451.csv Received shutdown request...